Control.Invariant

Documentation

class Show a => HasInvariant a where

Minimal complete definition

invariant

Methods

invariant :: a -> Invariant

updateCache :: a -> a

Instances

(Functor f, Show a, Show1 f, Show1 g, HasInvariant (f (g a))) => HasInvariant (Compose * * f g a)

Methods

invariant :: Compose * * f g a -> Invariant

updateCache :: Compose * * f g a -> Compose * * f g a

data Checked a

Instances

Functor Checked

Methods

fmap :: (a -> b) -> Checked a -> Checked b

(<$) :: a -> Checked b -> Checked a

Foldable Checked

Methods

fold :: Monoid m => Checked m -> m

foldMap :: Monoid m => (a -> m) -> Checked a -> m

foldr :: (a -> b -> b) -> b -> Checked a -> b

foldr' :: (a -> b -> b) -> b -> Checked a -> b

foldl :: (b -> a -> b) -> b -> Checked a -> b

foldl' :: (b -> a -> b) -> b -> Checked a -> b

foldr1 :: (a -> a -> a) -> Checked a -> a

foldl1 :: (a -> a -> a) -> Checked a -> a

toList :: Checked a -> [a]

null :: Checked a -> Bool

length :: Checked a -> Int

elem :: Eq a => a -> Checked a -> Bool

maximum :: Ord a => Checked a -> a

minimum :: Ord a => Checked a -> a

sum :: Num a => Checked a -> a

product :: Num a => Checked a -> a

Traversable Checked

Methods

traverse :: Applicative f => (a -> f b) -> Checked a -> f (Checked b)

sequenceA :: Applicative f => Checked (f a) -> f (Checked a)

mapM :: Monad m => (a -> m b) -> Checked a -> m (Checked b)

sequence :: Monad m => Checked (m a) -> m (Checked a)

Eq1 Checked

Methods

liftEq :: (a -> b -> Bool) -> Checked a -> Checked b -> Bool

Show1 Checked

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Checked a -> ShowS

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Checked a] -> ShowS

Eq a => Eq (Checked a)

Methods

(==) :: Checked a -> Checked a -> Bool

(/=) :: Checked a -> Checked a -> Bool

Ord a => Ord (Checked a)

Methods

compare :: Checked a -> Checked a -> Ordering

(<) :: Checked a -> Checked a -> Bool

(<=) :: Checked a -> Checked a -> Bool

(>) :: Checked a -> Checked a -> Bool

(>=) :: Checked a -> Checked a -> Bool

max :: Checked a -> Checked a -> Checked a

min :: Checked a -> Checked a -> Checked a

Show a => Show (Checked a)

Methods

showsPrec :: Int -> Checked a -> ShowS

show :: Checked a -> String

showList :: [Checked a] -> ShowS

(HasInvariant a, Arbitrary a) => Arbitrary (Checked a)

Methods

arbitrary :: Gen (Checked a)

shrink :: Checked a -> [Checked a]

NFData a => NFData (Checked a)

Methods

rnf :: Checked a -> ()

Controls (Checked a) a

Methods

content' :: Getter (Checked a) a

HasInvariant a => IsChecked (Checked a) a

Methods

check :: a -> Checked a

check' :: a -> Checked a

content :: Iso' (Checked a) a

Controls (Compose * * Checked f a) (f a)

Methods

content' :: Getter (Compose * * Checked f a) (f a)

HasInvariant (f a) => IsChecked (Compose * * Checked f a) (f a)

Methods

check :: f a -> Compose * * Checked f a

check' :: f a -> Compose * * Checked f a

content :: Iso' (Compose * * Checked f a) (f a)

class HasInvariant b => IsChecked a b | a -> b where

Minimal complete definition

check, check', content

Methods

check :: Pre => b -> a

check' :: Pre => b -> a

content :: Pre => Iso' a b

Instances

HasInvariant a => IsChecked (Checked a) a

Methods

check :: a -> Checked a

check' :: a -> Checked a

content :: Iso' (Checked a) a

HasInvariant (f a) => IsChecked (Compose * * Checked f a) (f a)

Methods

check :: f a -> Compose * * Checked f a

check' :: f a -> Compose * * Checked f a

content :: Iso' (Compose * * Checked f a) (f a)

mutate :: (IsChecked c a, Pre) => c -> State a k -> c

mutate' :: (IsChecked c a, Monad m, Pre) => StateT a m k -> StateT c m k

create' :: (IsChecked c a, Default a, Pre) => State a k -> c

class Controls a b | a -> b where

Methods

content' :: Getter a b

content' :: a ~ b => Getter a b

Instances

Controls (Checked a) a

Methods

content' :: Getter (Checked a) a

Controls (Compose * * Checked f a) (f a)

Methods

content' :: Getter (Compose * * Checked f a) (f a)

view' :: (Controls a b, MonadReader a m) => Getting c b c -> m c

(!.) :: Controls a b => a -> Getting c b c -> c infixl 8

views' :: (Controls a b, MonadReader a m) => Getting d b c -> (c -> d) -> m d

use' :: (Controls a b, MonadState a m) => Getting c b c -> m c

uses' :: (Controls a b, MonadState a m) => Getting d b c -> (c -> d) -> m d

class HasPrefix m where

Minimal complete definition

withPrefix

Methods

withPrefix :: String -> m a -> m a

(===) :: (Eq a, Show a) => a -> a -> Invariant infix 4

isSubsetOf' :: (Ord a, Show a) => Set a -> Set a -> Invariant

isProperSubsetOf' :: (Ord a, Show a) => Set a -> Set a -> Invariant

relation :: (Show a, Show b) => String -> (a -> b -> Bool) -> a -> b -> Invariant

trading :: (Functor f, Functor f') => Iso (Compose f (Compose g h) x) (Compose f' (Compose g' h') x') (Compose f g (h x)) (Compose f' g' (h' x'))

holds :: IsAssertion prop => prop -> Bool

invariantMessage :: IsAssertion a => a -> String

provided :: Pre => Bool -> a -> a

providedM :: Pre => Bool -> m a -> m a

assertFalse' :: Pre => String -> a

type Pre = ?loc :: CallStack

class IsAssertion a where

Minimal complete definition

toInvariant, fromBool

Methods

toInvariant :: a -> Invariant

fromBool :: Bool -> a

Instances

IsAssertion Bool

Methods

toInvariant :: Bool -> Invariant

fromBool :: Bool -> Bool

checkAssert :: (IsAssertion a, Pre) => a -> String -> b -> b

checkAssertM :: (IsAssertion a, Monad m, Pre) => a -> String -> m ()

type Invariant = InvariantM ()

(##) :: (IsAssertion b, Pre) => String -> b -> Invariant infixr 0

member' :: (Show k, Show a, Ord k) => k -> Map k a -> Invariant

isSubmapOf' :: (Ord k, Eq k, Eq a, Show k, Show a) => Map k a -> Map k a -> Invariant

isProperSubmapOf' :: (Eq k, Eq a, Ord k, Show k, Show a) => Map k a -> Map k a -> Invariant

Orphan instances

NFData (f (g x)) => NFData (Compose * * f g x)

Methods

rnf :: Compose * * f g x -> ()