Camfort.Specification.Stencils.InferenceBackend

Documentation

type Span a = (a, a)

spansToApproxSpatial :: [Span (Vec (S n) Int)] -> Either String (Approximation Spatial)

mkTrivialSpan :: Vec n Int -> Span (Vec n Int)

inferFromIndices :: VecList Int -> Specification

inferFromIndicesWithoutLinearity :: VecList Int -> Specification

inferCore :: [Vec n Int] -> Approximation Spatial

inferMinimalVectorRegions :: [Vec n Int] -> [Span (Vec n Int)]

|inferMinimalVectorRegions| a key part of the algorithm, from a list of n-dimensional relative indices it infers a list of (possibly overlapping) 1-dimensional spans (vectors) within the n-dimensional space. Built from |minimalise| and |allRegionPermutations|

coalesceContiguous :: [Span (Vec n Int)] -> [Span (Vec n Int)]

sequenceMaybes :: Eq a => [Maybe a] -> Maybe [a]

coalesce :: Span (Vec n Int) -> Span (Vec n Int) -> Maybe (Span (Vec n Int))

minimaliseRegions :: [Span (Vec n Int)] -> [Span (Vec n Int)]

Collapses the regions into a small set by looking for potential overlaps and eliminating those that overlap

containedWithin :: Span (Vec n Int) -> Span (Vec n Int) -> Bool

Binary predicate on whether the first region containedWithin the second