| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Camfort.Specification.Stencils.InferenceBackend
- 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)]
- 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)]
- containedWithin :: Span (Vec n Int) -> Span (Vec n Int) -> Bool
Documentation
inferMinimalVectorRegions :: [Vec n Int] -> [Span (Vec n Int)] Source #
|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|