Safe Haskell	None
Language	Haskell2010

Camfort.Specification.Stencils.Model

Contents

Orphan instances

Synopsis

Documentation

data Interval a where Source #

Interval data structure assumes the following: 1. The first num. param. is less than the second; 2. For holed intervals, first num. param. <= 0 <= second num. param.;

Constructors

IntervArbitrary :: Int -> Int -> Interval Arbitrary
IntervInfiniteArbitrary :: Interval Arbitrary
IntervHoled :: Int64 -> Int64 -> Bool -> Interval Standard
IntervInfinite :: Interval Standard

Instances

Eq (Interval a) Source #
Methods (==) :: Interval a -> Interval a -> Bool # (/=) :: Interval a -> Interval a -> Bool #
Show (Interval Standard) Source #
Methods showsPrec :: Int -> Interval Standard -> ShowS # show :: Interval Standard -> String # showList :: [Interval Standard] -> ShowS #
JoinSemiLattice (Interval Standard) Source #
Methods (\/) :: Interval Standard -> Interval Standard -> Interval Standard # join :: Interval Standard -> Interval Standard -> Interval Standard #
MeetSemiLattice (Interval Standard) Source #
Methods (/\) :: Interval Standard -> Interval Standard -> Interval Standard # meet :: Interval Standard -> Interval Standard -> Interval Standard #
Lattice (Interval Standard) Source #

BoundedJoinSemiLattice (Interval Standard) Source #
Methods bottom :: Interval Standard #
BoundedMeetSemiLattice (Interval Standard) Source #
Methods top :: Interval Standard #
BoundedLattice (Interval Standard) Source #

PartialOrd (Interval Standard) Source #
Methods (<=) :: Interval Standard -> Interval Standard -> Bool # (>=) :: Interval Standard -> Interval Standard -> Bool # (==) :: Interval Standard -> Interval Standard -> Bool # (/=) :: Interval Standard -> Interval Standard -> Bool # (<) :: Interval Standard -> Interval Standard -> Bool # (>) :: Interval Standard -> Interval Standard -> Bool # compare :: Interval Standard -> Interval Standard -> Maybe Ordering #

data Bound Source #

Constructors

Arbitrary
Standard

approxVec :: forall n. Vec n (Interval Arbitrary) -> Approximation (Vec n (Interval Standard)) Source #

data Offsets Source #

Constructors

Offsets (Set Int64)
SetOfIntegers

Instances

Eq Offsets Source #
Methods (==) :: Offsets -> Offsets -> Bool # (/=) :: Offsets -> Offsets -> Bool #
Ord Offsets Source #
Methods compare :: Offsets -> Offsets -> Ordering # (<) :: Offsets -> Offsets -> Bool # (<=) :: Offsets -> Offsets -> Bool # (>) :: Offsets -> Offsets -> Bool # (>=) :: Offsets -> Offsets -> Bool # max :: Offsets -> Offsets -> Offsets # min :: Offsets -> Offsets -> Offsets #
JoinSemiLattice Offsets Source #
Methods (\/) :: Offsets -> Offsets -> Offsets # join :: Offsets -> Offsets -> Offsets #
MeetSemiLattice Offsets Source #
Methods (/\) :: Offsets -> Offsets -> Offsets # meet :: Offsets -> Offsets -> Offsets #
Lattice Offsets Source #

BoundedJoinSemiLattice Offsets Source #
Methods bottom :: Offsets #
BoundedMeetSemiLattice Offsets Source #
Methods top :: Offsets #
BoundedLattice Offsets Source #

PartialOrd Offsets Source #
Methods (<=) :: Offsets -> Offsets -> Bool # (>=) :: Offsets -> Offsets -> Bool # (==) :: Offsets -> Offsets -> Bool # (/=) :: Offsets -> Offsets -> Bool # (<) :: Offsets -> Offsets -> Bool # (>) :: Offsets -> Offsets -> Bool # compare :: Offsets -> Offsets -> Maybe Ordering #

type UnionNF n a = NonEmpty (Vec n a) Source #

vecLength :: UnionNF n a -> Natural n Source #

unfCompare :: forall a b n. (Container a, Container b, MemberTyp a ~ Int64, MemberTyp b ~ Int64, CompTyp a ~ SInt64, CompTyp b ~ SInt64) => UnionNF n a -> UnionNF n b -> Ordering Source #

optimise :: UnionNF n (Interval Standard) -> UnionNF n (Interval Standard) Source #

maximas :: [Vec n (Interval Standard)] -> [Vec n (Interval Standard)] Source #

data Approximation a Source #

Constructors

Exact a
Bound (Maybe a) (Maybe a)

Instances

Functor Approximation Source #
Methods fmap :: (a -> b) -> Approximation a -> Approximation b # (<$) :: a -> Approximation b -> Approximation a #
Foldable Approximation Source #
Methods fold :: Monoid m => Approximation m -> m # foldMap :: Monoid m => (a -> m) -> Approximation a -> m # foldr :: (a -> b -> b) -> b -> Approximation a -> b # foldr' :: (a -> b -> b) -> b -> Approximation a -> b # foldl :: (b -> a -> b) -> b -> Approximation a -> b # foldl' :: (b -> a -> b) -> b -> Approximation a -> b # foldr1 :: (a -> a -> a) -> Approximation a -> a # foldl1 :: (a -> a -> a) -> Approximation a -> a # toList :: Approximation a -> [a] # null :: Approximation a -> Bool # length :: Approximation a -> Int # elem :: Eq a => a -> Approximation a -> Bool # maximum :: Ord a => Approximation a -> a # minimum :: Ord a => Approximation a -> a # sum :: Num a => Approximation a -> a # product :: Num a => Approximation a -> a #
Traversable Approximation Source #
Methods traverse :: Applicative f => (a -> f b) -> Approximation a -> f (Approximation b) # sequenceA :: Applicative f => Approximation (f a) -> f (Approximation a) # mapM :: Monad m => (a -> m b) -> Approximation a -> m (Approximation b) # sequence :: Monad m => Approximation (m a) -> m (Approximation a) #
Eq a => Eq (Approximation a) Source #
Methods (==) :: Approximation a -> Approximation a -> Bool # (/=) :: Approximation a -> Approximation a -> Bool #
Data a => Data (Approximation a) Source #
Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Approximation a -> c (Approximation a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Approximation a) # toConstr :: Approximation a -> Constr # dataTypeOf :: Approximation a -> DataType # dataCast1 :: Typeable (* -> ) t => (forall d. Data d => c (t d)) -> Maybe (c (Approximation a)) # dataCast2 :: Typeable ( -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Approximation a)) # gmapT :: (forall b. Data b => b -> b) -> Approximation a -> Approximation a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Approximation a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Approximation a -> r # gmapQ :: (forall d. Data d => d -> u) -> Approximation a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Approximation a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Approximation a -> m (Approximation a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Approximation a -> m (Approximation a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Approximation a -> m (Approximation a) #
Show (Multiplicity (Approximation Spatial)) #
Methods showsPrec :: Int -> Multiplicity (Approximation Spatial) -> ShowS # show :: Multiplicity (Approximation Spatial) -> String # showList :: [Multiplicity (Approximation Spatial)] -> ShowS #
Show a => Show (Approximation a) Source #
Methods showsPrec :: Int -> Approximation a -> ShowS # show :: Approximation a -> String # showList :: [Approximation a] -> ShowS #
Show (Approximation Spatial) #
Methods showsPrec :: Int -> Approximation Spatial -> ShowS # show :: Approximation Spatial -> String # showList :: [Approximation Spatial] -> ShowS #
RegionRig (Approximation Spatial) Source #
Methods sum :: Approximation Spatial -> Approximation Spatial -> Approximation Spatial Source # prod :: Approximation Spatial -> Approximation Spatial -> Approximation Spatial Source # one :: Approximation Spatial Source # zero :: Approximation Spatial Source # isUnit :: Approximation Spatial -> Bool Source #

lowerBound :: Approximation a -> a Source #

upperBound :: Approximation a -> a Source #

fromExact :: Approximation a -> a Source #

data Multiplicity a Source #

Constructors

Mult a
Once a

Instances

Functor Multiplicity Source #
Methods fmap :: (a -> b) -> Multiplicity a -> Multiplicity b # (<$) :: a -> Multiplicity b -> Multiplicity a #
Foldable Multiplicity Source #
Methods fold :: Monoid m => Multiplicity m -> m # foldMap :: Monoid m => (a -> m) -> Multiplicity a -> m # foldr :: (a -> b -> b) -> b -> Multiplicity a -> b # foldr' :: (a -> b -> b) -> b -> Multiplicity a -> b # foldl :: (b -> a -> b) -> b -> Multiplicity a -> b # foldl' :: (b -> a -> b) -> b -> Multiplicity a -> b # foldr1 :: (a -> a -> a) -> Multiplicity a -> a # foldl1 :: (a -> a -> a) -> Multiplicity a -> a # toList :: Multiplicity a -> [a] # null :: Multiplicity a -> Bool # length :: Multiplicity a -> Int # elem :: Eq a => a -> Multiplicity a -> Bool # maximum :: Ord a => Multiplicity a -> a # minimum :: Ord a => Multiplicity a -> a # sum :: Num a => Multiplicity a -> a # product :: Num a => Multiplicity a -> a #
Traversable Multiplicity Source #
Methods traverse :: Applicative f => (a -> f b) -> Multiplicity a -> f (Multiplicity b) # sequenceA :: Applicative f => Multiplicity (f a) -> f (Multiplicity a) # mapM :: Monad m => (a -> m b) -> Multiplicity a -> m (Multiplicity b) # sequence :: Monad m => Multiplicity (m a) -> m (Multiplicity a) #
Eq a => Eq (Multiplicity a) Source #
Methods (==) :: Multiplicity a -> Multiplicity a -> Bool # (/=) :: Multiplicity a -> Multiplicity a -> Bool #
Data a => Data (Multiplicity a) Source #
Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Multiplicity a -> c (Multiplicity a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Multiplicity a) # toConstr :: Multiplicity a -> Constr # dataTypeOf :: Multiplicity a -> DataType # dataCast1 :: Typeable (* -> ) t => (forall d. Data d => c (t d)) -> Maybe (c (Multiplicity a)) # dataCast2 :: Typeable ( -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Multiplicity a)) # gmapT :: (forall b. Data b => b -> b) -> Multiplicity a -> Multiplicity a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Multiplicity a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Multiplicity a -> r # gmapQ :: (forall d. Data d => d -> u) -> Multiplicity a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Multiplicity a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Multiplicity a -> m (Multiplicity a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Multiplicity a -> m (Multiplicity a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Multiplicity a -> m (Multiplicity a) #
Show a => Show (Multiplicity a) Source #
Methods showsPrec :: Int -> Multiplicity a -> ShowS # show :: Multiplicity a -> String # showList :: [Multiplicity a] -> ShowS #
Show (Multiplicity (Approximation Spatial)) #
Methods showsPrec :: Int -> Multiplicity (Approximation Spatial) -> ShowS # show :: Multiplicity (Approximation Spatial) -> String # showList :: [Multiplicity (Approximation Spatial)] -> ShowS #
Peelable (Multiplicity a) Source #
Associated Types type CoreTyp (Multiplicity a) :: * Source # Methods peel :: Multiplicity a -> CoreTyp (Multiplicity a) Source #
type CoreTyp (Multiplicity a) Source #
type CoreTyp (Multiplicity a) = a

class Peelable a where Source #

Minimal complete definition

peel

Associated Types

type CoreTyp a Source #

Methods

peel :: a -> CoreTyp a Source #

Instances

Peelable (Multiplicity a) Source #
Associated Types type CoreTyp (Multiplicity a) :: * Source # Methods peel :: Multiplicity a -> CoreTyp (Multiplicity a) Source #

Orphan instances

JoinSemiLattice (UnionNF n a) Source #
Methods (\/) :: UnionNF n a -> UnionNF n a -> UnionNF n a # join :: UnionNF n a -> UnionNF n a -> UnionNF n a #
BoundedLattice a => MeetSemiLattice (UnionNF n a) Source #
Methods (/\) :: UnionNF n a -> UnionNF n a -> UnionNF n a # meet :: UnionNF n a -> UnionNF n a -> UnionNF n a #
BoundedLattice a => Lattice (UnionNF n a) Source #

PartialOrd a => PartialOrd (Vec n a) Source #
Methods (<=) :: Vec n a -> Vec n a -> Bool # (>=) :: Vec n a -> Vec n a -> Bool # (==) :: Vec n a -> Vec n a -> Bool # (/=) :: Vec n a -> Vec n a -> Bool # (<) :: Vec n a -> Vec n a -> Bool # (>) :: Vec n a -> Vec n a -> Bool # compare :: Vec n a -> Vec n a -> Maybe Ordering #