Safe Haskell | None |
---|---|
Language | Haskell98 |
Data.Array.Repa.Repr.Partitioned
Documentation
Partitioned arrays. The last partition takes priority
These are produced by Repa's support functions and allow arrays to be defined using a different element function for each partition.
The basic idea is described in ``Efficient Parallel Stencil Convolution'', Ben Lippmeier and Gabriele Keller, Haskell 2011 -- though the underlying array representation has changed since this paper was published.
Instances
(Source r1 e, Source r2 e) => Source (P r1 r2) e Source # | Read elements from a partitioned array. |
Defined in Data.Array.Repa.Repr.Partitioned Methods extent :: Shape sh => Array (P r1 r2) sh e -> sh Source # index :: Shape sh => Array (P r1 r2) sh e -> sh -> e Source # unsafeIndex :: Shape sh => Array (P r1 r2) sh e -> sh -> e Source # linearIndex :: Shape sh => Array (P r1 r2) sh e -> Int -> e Source # unsafeLinearIndex :: Shape sh => Array (P r1 r2) sh e -> Int -> e Source # deepSeqArray :: Shape sh => Array (P r1 r2) sh e -> b -> b Source # | |
(LoadRange r1 sh e, Load r2 sh e) => Load (P r1 r2) sh e Source # | |
(Structured r1 a b, Structured r2 a b) => Structured (P r1 r2) a b Source # | |
Defined in Data.Array.Repa.Operators.Mapping | |
data Array (P r1 r2) sh e Source # | |
type TR (P r1 r2) Source # | |
data family Array r sh e Source #