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 #
Instances
(Shape sh, Eq sh, Source r a, Eq a) => Eq (Array r sh a) | |
Read (Array r1 sh e) => Read (Array (S r1) sh e) | |
Read (Array r1 sh e) => Read (Array (I r1) sh e) | |
Read sh => Read (Array B sh Word8) | |
(Read sh, Read e) => Read (Array V sh e) | |
Read sh => Read (Array X sh e) | |
(Read sh, Read e, Unbox e) => Read (Array U sh e) | |
Show (Array r1 sh e) => Show (Array (S r1) sh e) | |
Show (Array r1 sh e) => Show (Array (I r1) sh e) | |
Show sh => Show (Array B sh Word8) | |
(Show sh, Show e) => Show (Array V sh e) | |
Show sh => Show (Array X sh e) | |
(Show sh, Show e, Unbox e) => Show (Array U sh e) | |
(Arbitrary sh, Arbitrary a, Shape sh) => Arbitrary (Array V sh a) Source # | |
(Arbitrary sh, Arbitrary a, Unbox a, Shape sh) => Arbitrary (Array U sh a) Source # | |
(CoArbitrary sh, CoArbitrary a, Source r a, Shape sh) => CoArbitrary (Array r sh a) Source # | |
Defined in Data.Array.Repa.Arbitrary | |
data Array D sh a Source # | |
Defined in Data.Array.Repa.Repr.Delayed | |
data Array F sh a Source # | |
Defined in Data.Array.Repa.Repr.ForeignPtr | |
data Array V sh a Source # | |
Defined in Data.Array.Repa.Repr.Vector | |
data Array X sh e Source # | |
Defined in Data.Array.Repa.Repr.Undefined | |
data Array C sh a Source # | |
Defined in Data.Array.Repa.Repr.Cursored data Array C sh a = ACursored {
| |
data Array U sh a Source # | |
Defined in Data.Array.Repa.Repr.Unboxed | |
data Array B sh Word8 Source # | |
Defined in Data.Array.Repa.Repr.ByteString | |
data Array (S r1) sh a Source # | |
Defined in Data.Array.Repa.Repr.HintSmall | |
data Array (I r1) sh a Source # | |
Defined in Data.Array.Repa.Repr.HintInterleave | |
data Array (P r1 r2) sh e Source # | |