{-# LANGUAGE BangPatterns #-}
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE MultiParamTypeClasses #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE MonoLocalBinds #-}
module Data.Massiv.Array.Ops.Map
( map
, imap
, traverseA
, traverseA_
, itraverseA
, itraverseA_
, sequenceA
, sequenceA_
, traversePrim
, itraversePrim
, mapM
, forM
, imapM
, iforM
, mapM_
, forM_
, imapM_
, iforM_
, mapIO
, mapWS
, mapIO_
, imapIO
, imapWS
, imapIO_
, forIO
, forWS
, forIO_
, iforIO
, iforWS
, iforIO_
, imapSchedulerM_
, iforSchedulerM_
, iterArrayLinearM_
, iterArrayLinearWithSetM_
, iterArrayLinearWithStrideM_
, zip
, zip3
, zip4
, unzip
, unzip3
, unzip4
, zipWith
, zipWith3
, zipWith4
, izipWith
, izipWith3
, izipWith4
, zipWithA
, izipWithA
, zipWith3A
, izipWith3A
) where
import Control.Monad (void)
import Control.Monad.Primitive
import Control.Scheduler
import Data.Coerce
import Data.Massiv.Array.Delayed.Pull
import Data.Massiv.Array.Mutable
import Data.Massiv.Array.Ops.Construct (makeArrayA, makeArrayLinearA)
import Data.Massiv.Core.Common
import Prelude hiding (map, mapM, mapM_, sequenceA, traverse, unzip, unzip3,
zip, zip3, zipWith, zipWith3)
map :: (Index ix, Source r e') => (e' -> e) -> Array r ix e' -> Array D ix e
map :: (e' -> e) -> Array r ix e' -> Array D ix e
map e' -> e
f = (ix -> e' -> e) -> Array r ix e' -> Array D ix e
forall r ix e a.
(Index ix, Source r e) =>
(ix -> e -> a) -> Array r ix e -> Array D ix a
imap ((e' -> e) -> ix -> e' -> e
forall a b. a -> b -> a
const e' -> e
f)
{-# INLINE map #-}
zip :: (Index ix, Source r1 e1, Source r2 e2)
=> Array r1 ix e1 -> Array r2 ix e2 -> Array D ix (e1, e2)
zip :: Array r1 ix e1 -> Array r2 ix e2 -> Array D ix (e1, e2)
zip = (e1 -> e2 -> (e1, e2))
-> Array r1 ix e1 -> Array r2 ix e2 -> Array D ix (e1, e2)
forall ix r1 e1 r2 e2 e.
(Index ix, Source r1 e1, Source r2 e2) =>
(e1 -> e2 -> e) -> Array r1 ix e1 -> Array r2 ix e2 -> Array D ix e
zipWith (,)
{-# INLINE zip #-}
zip3 :: (Index ix, Source r1 e1, Source r2 e2, Source r3 e3)
=> Array r1 ix e1 -> Array r2 ix e2 -> Array r3 ix e3 -> Array D ix (e1, e2, e3)
zip3 :: Array r1 ix e1
-> Array r2 ix e2 -> Array r3 ix e3 -> Array D ix (e1, e2, e3)
zip3 = (e1 -> e2 -> e3 -> (e1, e2, e3))
-> Array r1 ix e1
-> Array r2 ix e2
-> Array r3 ix e3
-> Array D ix (e1, e2, e3)
forall ix r1 e1 r2 e2 r3 e3 e.
(Index ix, Source r1 e1, Source r2 e2, Source r3 e3) =>
(e1 -> e2 -> e3 -> e)
-> Array r1 ix e1
-> Array r2 ix e2
-> Array r3 ix e3
-> Array D ix e
zipWith3 (,,)
{-# INLINE zip3 #-}
zip4 ::
(Index ix, Source r1 e1, Source r2 e2, Source r3 e3, Source r4 e4)
=> Array r1 ix e1
-> Array r2 ix e2
-> Array r3 ix e3
-> Array r4 ix e4
-> Array D ix (e1, e2, e3, e4)
zip4 :: Array r1 ix e1
-> Array r2 ix e2
-> Array r3 ix e3
-> Array r4 ix e4
-> Array D ix (e1, e2, e3, e4)
zip4 = (e1 -> e2 -> e3 -> e4 -> (e1, e2, e3, e4))
-> Array r1 ix e1
-> Array r2 ix e2
-> Array r3 ix e3
-> Array r4 ix e4
-> Array D ix (e1, e2, e3, e4)
forall ix r1 e1 r2 e2 r3 e3 r4 e4 e.
(Index ix, Source r1 e1, Source r2 e2, Source r3 e3,
Source r4 e4) =>
(e1 -> e2 -> e3 -> e4 -> e)
-> Array r1 ix e1
-> Array r2 ix e2
-> Array r3 ix e3
-> Array r4 ix e4
-> Array D ix e
zipWith4 (,,,)
{-# INLINE zip4 #-}
unzip :: (Index ix, Source r (e1, e2)) => Array r ix (e1, e2) -> (Array D ix e1, Array D ix e2)
unzip :: Array r ix (e1, e2) -> (Array D ix e1, Array D ix e2)
unzip Array r ix (e1, e2)
arr = (((e1, e2) -> e1) -> Array r ix (e1, e2) -> Array D ix e1
forall ix r e' e.
(Index ix, Source r e') =>
(e' -> e) -> Array r ix e' -> Array D ix e
map (e1, e2) -> e1
forall a b. (a, b) -> a
fst Array r ix (e1, e2)
arr, ((e1, e2) -> e2) -> Array r ix (e1, e2) -> Array D ix e2
forall ix r e' e.
(Index ix, Source r e') =>
(e' -> e) -> Array r ix e' -> Array D ix e
map (e1, e2) -> e2
forall a b. (a, b) -> b
snd Array r ix (e1, e2)
arr)
{-# INLINE unzip #-}
unzip3 :: (Index ix, Source r (e1, e2, e3))
=> Array r ix (e1, e2, e3) -> (Array D ix e1, Array D ix e2, Array D ix e3)
unzip3 :: Array r ix (e1, e2, e3)
-> (Array D ix e1, Array D ix e2, Array D ix e3)
unzip3 Array r ix (e1, e2, e3)
arr = (((e1, e2, e3) -> e1) -> Array r ix (e1, e2, e3) -> Array D ix e1
forall ix r e' e.
(Index ix, Source r e') =>
(e' -> e) -> Array r ix e' -> Array D ix e
map (\ (e1
e, e2
_, e3
_) -> e1
e) Array r ix (e1, e2, e3)
arr, ((e1, e2, e3) -> e2) -> Array r ix (e1, e2, e3) -> Array D ix e2
forall ix r e' e.
(Index ix, Source r e') =>
(e' -> e) -> Array r ix e' -> Array D ix e
map (\ (e1
_, e2
e, e3
_) -> e2
e) Array r ix (e1, e2, e3)
arr, ((e1, e2, e3) -> e3) -> Array r ix (e1, e2, e3) -> Array D ix e3
forall ix r e' e.
(Index ix, Source r e') =>
(e' -> e) -> Array r ix e' -> Array D ix e
map (\ (e1
_, e2
_, e3
e) -> e3
e) Array r ix (e1, e2, e3)
arr)
{-# INLINE unzip3 #-}
unzip4 :: (Index ix, Source r (e1, e2, e3, e4))
=> Array r ix (e1, e2, e3, e4) -> (Array D ix e1, Array D ix e2, Array D ix e3, Array D ix e4)
unzip4 :: Array r ix (e1, e2, e3, e4)
-> (Array D ix e1, Array D ix e2, Array D ix e3, Array D ix e4)
unzip4 Array r ix (e1, e2, e3, e4)
arr =
( ((e1, e2, e3, e4) -> e1)
-> Array r ix (e1, e2, e3, e4) -> Array D ix e1
forall ix r e' e.
(Index ix, Source r e') =>
(e' -> e) -> Array r ix e' -> Array D ix e
map (\(e1
e, e2
_, e3
_, e4
_) -> e1
e) Array r ix (e1, e2, e3, e4)
arr
, ((e1, e2, e3, e4) -> e2)
-> Array r ix (e1, e2, e3, e4) -> Array D ix e2
forall ix r e' e.
(Index ix, Source r e') =>
(e' -> e) -> Array r ix e' -> Array D ix e
map (\(e1
_, e2
e, e3
_, e4
_) -> e2
e) Array r ix (e1, e2, e3, e4)
arr
, ((e1, e2, e3, e4) -> e3)
-> Array r ix (e1, e2, e3, e4) -> Array D ix e3
forall ix r e' e.
(Index ix, Source r e') =>
(e' -> e) -> Array r ix e' -> Array D ix e
map (\(e1
_, e2
_, e3
e, e4
_) -> e3
e) Array r ix (e1, e2, e3, e4)
arr
, ((e1, e2, e3, e4) -> e4)
-> Array r ix (e1, e2, e3, e4) -> Array D ix e4
forall ix r e' e.
(Index ix, Source r e') =>
(e' -> e) -> Array r ix e' -> Array D ix e
map (\(e1
_, e2
_, e3
_, e4
e) -> e4
e) Array r ix (e1, e2, e3, e4)
arr)
{-# INLINE unzip4 #-}
zipWith :: (Index ix, Source r1 e1, Source r2 e2)
=> (e1 -> e2 -> e) -> Array r1 ix e1 -> Array r2 ix e2 -> Array D ix e
zipWith :: (e1 -> e2 -> e) -> Array r1 ix e1 -> Array r2 ix e2 -> Array D ix e
zipWith e1 -> e2 -> e
f = (ix -> e1 -> e2 -> e)
-> Array r1 ix e1 -> Array r2 ix e2 -> Array D ix e
forall ix r1 e1 r2 e2 e.
(Index ix, Source r1 e1, Source r2 e2) =>
(ix -> e1 -> e2 -> e)
-> Array r1 ix e1 -> Array r2 ix e2 -> Array D ix e
izipWith (\ ix
_ e1
e1 e2
e2 -> e1 -> e2 -> e
f e1
e1 e2
e2)
{-# INLINE zipWith #-}
izipWith :: (Index ix, Source r1 e1, Source r2 e2)
=> (ix -> e1 -> e2 -> e) -> Array r1 ix e1 -> Array r2 ix e2 -> Array D ix e
izipWith :: (ix -> e1 -> e2 -> e)
-> Array r1 ix e1 -> Array r2 ix e2 -> Array D ix e
izipWith ix -> e1 -> e2 -> e
f Array r1 ix e1
arr1 Array r2 ix e2
arr2 =
Comp -> Sz ix -> (ix -> e) -> Array D ix e
forall ix e. Comp -> Sz ix -> (ix -> e) -> Array D ix e
DArray
(Array r1 ix e1 -> Comp
forall r ix e. Strategy r => Array r ix e -> Comp
getComp Array r1 ix e1
arr1 Comp -> Comp -> Comp
forall a. Semigroup a => a -> a -> a
<> Array r2 ix e2 -> Comp
forall r ix e. Strategy r => Array r ix e -> Comp
getComp Array r2 ix e2
arr2)
(ix -> Sz ix
forall ix. ix -> Sz ix
SafeSz ((Int -> Int -> Int) -> ix -> ix -> ix
forall ix. Index ix => (Int -> Int -> Int) -> ix -> ix -> ix
liftIndex2 Int -> Int -> Int
forall a. Ord a => a -> a -> a
min (Sz ix -> ix
coerce (Array r1 ix e1 -> Sz ix
forall r ix e. Size r => Array r ix e -> Sz ix
size Array r1 ix e1
arr1)) (Sz ix -> ix
coerce (Array r2 ix e2 -> Sz ix
forall r ix e. Size r => Array r ix e -> Sz ix
size Array r2 ix e2
arr2)))) ((ix -> e) -> Array D ix e) -> (ix -> e) -> Array D ix e
forall a b. (a -> b) -> a -> b
$ \ !ix
ix ->
ix -> e1 -> e2 -> e
f ix
ix (Array r1 ix e1 -> ix -> e1
forall r e ix. (Source r e, Index ix) => Array r ix e -> ix -> e
unsafeIndex Array r1 ix e1
arr1 ix
ix) (Array r2 ix e2 -> ix -> e2
forall r e ix. (Source r e, Index ix) => Array r ix e -> ix -> e
unsafeIndex Array r2 ix e2
arr2 ix
ix)
{-# INLINE izipWith #-}
zipWith3 :: (Index ix, Source r1 e1, Source r2 e2, Source r3 e3)
=> (e1 -> e2 -> e3 -> e) -> Array r1 ix e1 -> Array r2 ix e2 -> Array r3 ix e3 -> Array D ix e
zipWith3 :: (e1 -> e2 -> e3 -> e)
-> Array r1 ix e1
-> Array r2 ix e2
-> Array r3 ix e3
-> Array D ix e
zipWith3 e1 -> e2 -> e3 -> e
f = (ix -> e1 -> e2 -> e3 -> e)
-> Array r1 ix e1
-> Array r2 ix e2
-> Array r3 ix e3
-> Array D ix e
forall ix r1 e1 r2 e2 r3 e3 e.
(Index ix, Source r1 e1, Source r2 e2, Source r3 e3) =>
(ix -> e1 -> e2 -> e3 -> e)
-> Array r1 ix e1
-> Array r2 ix e2
-> Array r3 ix e3
-> Array D ix e
izipWith3 (\ ix
_ e1
e1 e2
e2 e3
e3 -> e1 -> e2 -> e3 -> e
f e1
e1 e2
e2 e3
e3)
{-# INLINE zipWith3 #-}
izipWith3
:: (Index ix, Source r1 e1, Source r2 e2, Source r3 e3)
=> (ix -> e1 -> e2 -> e3 -> e)
-> Array r1 ix e1
-> Array r2 ix e2
-> Array r3 ix e3
-> Array D ix e
izipWith3 :: (ix -> e1 -> e2 -> e3 -> e)
-> Array r1 ix e1
-> Array r2 ix e2
-> Array r3 ix e3
-> Array D ix e
izipWith3 ix -> e1 -> e2 -> e3 -> e
f Array r1 ix e1
arr1 Array r2 ix e2
arr2 Array r3 ix e3
arr3 =
Comp -> Sz ix -> (ix -> e) -> Array D ix e
forall ix e. Comp -> Sz ix -> (ix -> e) -> Array D ix e
DArray
(Array r1 ix e1 -> Comp
forall r ix e. Strategy r => Array r ix e -> Comp
getComp Array r1 ix e1
arr1 Comp -> Comp -> Comp
forall a. Semigroup a => a -> a -> a
<> Array r2 ix e2 -> Comp
forall r ix e. Strategy r => Array r ix e -> Comp
getComp Array r2 ix e2
arr2 Comp -> Comp -> Comp
forall a. Semigroup a => a -> a -> a
<> Array r3 ix e3 -> Comp
forall r ix e. Strategy r => Array r ix e -> Comp
getComp Array r3 ix e3
arr3)
(ix -> Sz ix
forall ix. ix -> Sz ix
SafeSz
((Int -> Int -> Int) -> ix -> ix -> ix
forall ix. Index ix => (Int -> Int -> Int) -> ix -> ix -> ix
liftIndex2
Int -> Int -> Int
forall a. Ord a => a -> a -> a
min
((Int -> Int -> Int) -> ix -> ix -> ix
forall ix. Index ix => (Int -> Int -> Int) -> ix -> ix -> ix
liftIndex2 Int -> Int -> Int
forall a. Ord a => a -> a -> a
min (Sz ix -> ix
coerce (Array r1 ix e1 -> Sz ix
forall r ix e. Size r => Array r ix e -> Sz ix
size Array r1 ix e1
arr1)) (Sz ix -> ix
coerce (Array r2 ix e2 -> Sz ix
forall r ix e. Size r => Array r ix e -> Sz ix
size Array r2 ix e2
arr2)))
(Sz ix -> ix
coerce (Array r3 ix e3 -> Sz ix
forall r ix e. Size r => Array r ix e -> Sz ix
size Array r3 ix e3
arr3)))) ((ix -> e) -> Array D ix e) -> (ix -> e) -> Array D ix e
forall a b. (a -> b) -> a -> b
$ \ !ix
ix ->
ix -> e1 -> e2 -> e3 -> e
f ix
ix (Array r1 ix e1 -> ix -> e1
forall r e ix. (Source r e, Index ix) => Array r ix e -> ix -> e
unsafeIndex Array r1 ix e1
arr1 ix
ix) (Array r2 ix e2 -> ix -> e2
forall r e ix. (Source r e, Index ix) => Array r ix e -> ix -> e
unsafeIndex Array r2 ix e2
arr2 ix
ix) (Array r3 ix e3 -> ix -> e3
forall r e ix. (Source r e, Index ix) => Array r ix e -> ix -> e
unsafeIndex Array r3 ix e3
arr3 ix
ix)
{-# INLINE izipWith3 #-}
zipWith4 ::
(Index ix, Source r1 e1, Source r2 e2, Source r3 e3, Source r4 e4)
=> (e1 -> e2 -> e3 -> e4 -> e)
-> Array r1 ix e1
-> Array r2 ix e2
-> Array r3 ix e3
-> Array r4 ix e4
-> Array D ix e
zipWith4 :: (e1 -> e2 -> e3 -> e4 -> e)
-> Array r1 ix e1
-> Array r2 ix e2
-> Array r3 ix e3
-> Array r4 ix e4
-> Array D ix e
zipWith4 e1 -> e2 -> e3 -> e4 -> e
f = (ix -> e1 -> e2 -> e3 -> e4 -> e)
-> Array r1 ix e1
-> Array r2 ix e2
-> Array r3 ix e3
-> Array r4 ix e4
-> Array D ix e
forall ix r1 e1 r2 e2 r3 e3 r4 e4 e.
(Index ix, Source r1 e1, Source r2 e2, Source r3 e3,
Source r4 e4) =>
(ix -> e1 -> e2 -> e3 -> e4 -> e)
-> Array r1 ix e1
-> Array r2 ix e2
-> Array r3 ix e3
-> Array r4 ix e4
-> Array D ix e
izipWith4 (\ ix
_ e1
e1 e2
e2 e3
e3 e4
e4 -> e1 -> e2 -> e3 -> e4 -> e
f e1
e1 e2
e2 e3
e3 e4
e4)
{-# INLINE zipWith4 #-}
izipWith4
:: (Index ix, Source r1 e1, Source r2 e2, Source r3 e3, Source r4 e4)
=> (ix -> e1 -> e2 -> e3 -> e4 -> e)
-> Array r1 ix e1
-> Array r2 ix e2
-> Array r3 ix e3
-> Array r4 ix e4
-> Array D ix e
izipWith4 :: (ix -> e1 -> e2 -> e3 -> e4 -> e)
-> Array r1 ix e1
-> Array r2 ix e2
-> Array r3 ix e3
-> Array r4 ix e4
-> Array D ix e
izipWith4 ix -> e1 -> e2 -> e3 -> e4 -> e
f Array r1 ix e1
arr1 Array r2 ix e2
arr2 Array r3 ix e3
arr3 Array r4 ix e4
arr4 =
Comp -> Sz ix -> (ix -> e) -> Array D ix e
forall ix e. Comp -> Sz ix -> (ix -> e) -> Array D ix e
DArray
(Array r1 ix e1 -> Comp
forall r ix e. Strategy r => Array r ix e -> Comp
getComp Array r1 ix e1
arr1 Comp -> Comp -> Comp
forall a. Semigroup a => a -> a -> a
<> Array r2 ix e2 -> Comp
forall r ix e. Strategy r => Array r ix e -> Comp
getComp Array r2 ix e2
arr2 Comp -> Comp -> Comp
forall a. Semigroup a => a -> a -> a
<> Array r3 ix e3 -> Comp
forall r ix e. Strategy r => Array r ix e -> Comp
getComp Array r3 ix e3
arr3 Comp -> Comp -> Comp
forall a. Semigroup a => a -> a -> a
<> Array r4 ix e4 -> Comp
forall r ix e. Strategy r => Array r ix e -> Comp
getComp Array r4 ix e4
arr4)
(ix -> Sz ix
forall ix. ix -> Sz ix
SafeSz
((Int -> Int -> Int) -> ix -> ix -> ix
forall ix. Index ix => (Int -> Int -> Int) -> ix -> ix -> ix
liftIndex2
Int -> Int -> Int
forall a. Ord a => a -> a -> a
min
((Int -> Int -> Int) -> ix -> ix -> ix
forall ix. Index ix => (Int -> Int -> Int) -> ix -> ix -> ix
liftIndex2
Int -> Int -> Int
forall a. Ord a => a -> a -> a
min
((Int -> Int -> Int) -> ix -> ix -> ix
forall ix. Index ix => (Int -> Int -> Int) -> ix -> ix -> ix
liftIndex2 Int -> Int -> Int
forall a. Ord a => a -> a -> a
min (Sz ix -> ix
coerce (Array r1 ix e1 -> Sz ix
forall r ix e. Size r => Array r ix e -> Sz ix
size Array r1 ix e1
arr1)) (Sz ix -> ix
coerce (Array r2 ix e2 -> Sz ix
forall r ix e. Size r => Array r ix e -> Sz ix
size Array r2 ix e2
arr2)))
(Sz ix -> ix
coerce (Array r3 ix e3 -> Sz ix
forall r ix e. Size r => Array r ix e -> Sz ix
size Array r3 ix e3
arr3)))
(Sz ix -> ix
coerce (Array r4 ix e4 -> Sz ix
forall r ix e. Size r => Array r ix e -> Sz ix
size Array r4 ix e4
arr4)))) ((ix -> e) -> Array D ix e) -> (ix -> e) -> Array D ix e
forall a b. (a -> b) -> a -> b
$ \ !ix
ix ->
ix -> e1 -> e2 -> e3 -> e4 -> e
f ix
ix (Array r1 ix e1 -> ix -> e1
forall r e ix. (Source r e, Index ix) => Array r ix e -> ix -> e
unsafeIndex Array r1 ix e1
arr1 ix
ix) (Array r2 ix e2 -> ix -> e2
forall r e ix. (Source r e, Index ix) => Array r ix e -> ix -> e
unsafeIndex Array r2 ix e2
arr2 ix
ix) (Array r3 ix e3 -> ix -> e3
forall r e ix. (Source r e, Index ix) => Array r ix e -> ix -> e
unsafeIndex Array r3 ix e3
arr3 ix
ix) (Array r4 ix e4 -> ix -> e4
forall r e ix. (Source r e, Index ix) => Array r ix e -> ix -> e
unsafeIndex Array r4 ix e4
arr4 ix
ix)
{-# INLINE izipWith4 #-}
zipWithA ::
(Source r1 e1, Source r2 e2, Applicative f, Manifest r e, Index ix)
=> (e1 -> e2 -> f e)
-> Array r1 ix e1
-> Array r2 ix e2
-> f (Array r ix e)
zipWithA :: (e1 -> e2 -> f e)
-> Array r1 ix e1 -> Array r2 ix e2 -> f (Array r ix e)
zipWithA e1 -> e2 -> f e
f = (ix -> e1 -> e2 -> f e)
-> Array r1 ix e1 -> Array r2 ix e2 -> f (Array r ix e)
forall r1 e1 r2 e2 (f :: * -> *) r e ix.
(Source r1 e1, Source r2 e2, Applicative f, Manifest r e,
Index ix) =>
(ix -> e1 -> e2 -> f e)
-> Array r1 ix e1 -> Array r2 ix e2 -> f (Array r ix e)
izipWithA ((e1 -> e2 -> f e) -> ix -> e1 -> e2 -> f e
forall a b. a -> b -> a
const e1 -> e2 -> f e
f)
{-# INLINE zipWithA #-}
izipWithA ::
(Source r1 e1, Source r2 e2, Applicative f, Manifest r e, Index ix)
=> (ix -> e1 -> e2 -> f e)
-> Array r1 ix e1
-> Array r2 ix e2
-> f (Array r ix e)
izipWithA :: (ix -> e1 -> e2 -> f e)
-> Array r1 ix e1 -> Array r2 ix e2 -> f (Array r ix e)
izipWithA ix -> e1 -> e2 -> f e
f Array r1 ix e1
arr1 Array r2 ix e2
arr2 =
Comp -> Array r ix e -> Array r ix e
forall r ix e. Strategy r => Comp -> Array r ix e -> Array r ix e
setComp (Array r1 ix e1 -> Comp
forall r ix e. Strategy r => Array r ix e -> Comp
getComp Array r1 ix e1
arr1 Comp -> Comp -> Comp
forall a. Semigroup a => a -> a -> a
<> Array r2 ix e2 -> Comp
forall r ix e. Strategy r => Array r ix e -> Comp
getComp Array r2 ix e2
arr2) (Array r ix e -> Array r ix e)
-> f (Array r ix e) -> f (Array r ix e)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$>
Sz ix -> (ix -> f e) -> f (Array r ix e)
forall r ix e (f :: * -> *).
(Manifest r e, Index ix, Applicative f) =>
Sz ix -> (ix -> f e) -> f (Array r ix e)
makeArrayA
(ix -> Sz ix
forall ix. ix -> Sz ix
SafeSz ((Int -> Int -> Int) -> ix -> ix -> ix
forall ix. Index ix => (Int -> Int -> Int) -> ix -> ix -> ix
liftIndex2 Int -> Int -> Int
forall a. Ord a => a -> a -> a
min (Sz ix -> ix
coerce (Array r1 ix e1 -> Sz ix
forall r ix e. Size r => Array r ix e -> Sz ix
size Array r1 ix e1
arr1)) (Sz ix -> ix
coerce (Array r2 ix e2 -> Sz ix
forall r ix e. Size r => Array r ix e -> Sz ix
size Array r2 ix e2
arr2))))
(\ !ix
ix -> ix -> e1 -> e2 -> f e
f ix
ix (Array r1 ix e1 -> ix -> e1
forall r e ix. (Source r e, Index ix) => Array r ix e -> ix -> e
unsafeIndex Array r1 ix e1
arr1 ix
ix) (Array r2 ix e2 -> ix -> e2
forall r e ix. (Source r e, Index ix) => Array r ix e -> ix -> e
unsafeIndex Array r2 ix e2
arr2 ix
ix))
{-# INLINE izipWithA #-}
zipWith3A ::
(Source r1 e1, Source r2 e2, Source r3 e3, Applicative f, Manifest r e, Index ix)
=> (e1 -> e2 -> e3 -> f e)
-> Array r1 ix e1
-> Array r2 ix e2
-> Array r3 ix e3
-> f (Array r ix e)
zipWith3A :: (e1 -> e2 -> e3 -> f e)
-> Array r1 ix e1
-> Array r2 ix e2
-> Array r3 ix e3
-> f (Array r ix e)
zipWith3A e1 -> e2 -> e3 -> f e
f = (ix -> e1 -> e2 -> e3 -> f e)
-> Array r1 ix e1
-> Array r2 ix e2
-> Array r3 ix e3
-> f (Array r ix e)
forall r1 e1 r2 e2 r3 e3 (f :: * -> *) r e ix.
(Source r1 e1, Source r2 e2, Source r3 e3, Applicative f,
Manifest r e, Index ix) =>
(ix -> e1 -> e2 -> e3 -> f e)
-> Array r1 ix e1
-> Array r2 ix e2
-> Array r3 ix e3
-> f (Array r ix e)
izipWith3A ((e1 -> e2 -> e3 -> f e) -> ix -> e1 -> e2 -> e3 -> f e
forall a b. a -> b -> a
const e1 -> e2 -> e3 -> f e
f)
{-# INLINE zipWith3A #-}
izipWith3A ::
(Source r1 e1, Source r2 e2, Source r3 e3, Applicative f, Manifest r e, Index ix)
=> (ix -> e1 -> e2 -> e3 -> f e)
-> Array r1 ix e1
-> Array r2 ix e2
-> Array r3 ix e3
-> f (Array r ix e)
izipWith3A :: (ix -> e1 -> e2 -> e3 -> f e)
-> Array r1 ix e1
-> Array r2 ix e2
-> Array r3 ix e3
-> f (Array r ix e)
izipWith3A ix -> e1 -> e2 -> e3 -> f e
f Array r1 ix e1
arr1 Array r2 ix e2
arr2 Array r3 ix e3
arr3 =
Comp -> Array r ix e -> Array r ix e
forall r ix e. Strategy r => Comp -> Array r ix e -> Array r ix e
setComp (Array r1 ix e1 -> Comp
forall r ix e. Strategy r => Array r ix e -> Comp
getComp Array r1 ix e1
arr1 Comp -> Comp -> Comp
forall a. Semigroup a => a -> a -> a
<> Array r2 ix e2 -> Comp
forall r ix e. Strategy r => Array r ix e -> Comp
getComp Array r2 ix e2
arr2 Comp -> Comp -> Comp
forall a. Semigroup a => a -> a -> a
<> Array r3 ix e3 -> Comp
forall r ix e. Strategy r => Array r ix e -> Comp
getComp Array r3 ix e3
arr3) (Array r ix e -> Array r ix e)
-> f (Array r ix e) -> f (Array r ix e)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$>
Sz ix -> (ix -> f e) -> f (Array r ix e)
forall r ix e (f :: * -> *).
(Manifest r e, Index ix, Applicative f) =>
Sz ix -> (ix -> f e) -> f (Array r ix e)
makeArrayA Sz ix
sz (\ !ix
ix -> ix -> e1 -> e2 -> e3 -> f e
f ix
ix (Array r1 ix e1 -> ix -> e1
forall r e ix. (Source r e, Index ix) => Array r ix e -> ix -> e
unsafeIndex Array r1 ix e1
arr1 ix
ix) (Array r2 ix e2 -> ix -> e2
forall r e ix. (Source r e, Index ix) => Array r ix e -> ix -> e
unsafeIndex Array r2 ix e2
arr2 ix
ix) (Array r3 ix e3 -> ix -> e3
forall r e ix. (Source r e, Index ix) => Array r ix e -> ix -> e
unsafeIndex Array r3 ix e3
arr3 ix
ix))
where
sz :: Sz ix
sz =
ix -> Sz ix
forall ix. ix -> Sz ix
SafeSz (ix -> Sz ix) -> ix -> Sz ix
forall a b. (a -> b) -> a -> b
$
(Int -> Int -> Int) -> ix -> ix -> ix
forall ix. Index ix => (Int -> Int -> Int) -> ix -> ix -> ix
liftIndex2 Int -> Int -> Int
forall a. Ord a => a -> a -> a
min ((Int -> Int -> Int) -> ix -> ix -> ix
forall ix. Index ix => (Int -> Int -> Int) -> ix -> ix -> ix
liftIndex2 Int -> Int -> Int
forall a. Ord a => a -> a -> a
min (Sz ix -> ix
coerce (Array r1 ix e1 -> Sz ix
forall r ix e. Size r => Array r ix e -> Sz ix
size Array r1 ix e1
arr1)) (Sz ix -> ix
coerce (Array r2 ix e2 -> Sz ix
forall r ix e. Size r => Array r ix e -> Sz ix
size Array r2 ix e2
arr2))) (Sz ix -> ix
coerce (Array r3 ix e3 -> Sz ix
forall r ix e. Size r => Array r ix e -> Sz ix
size Array r3 ix e3
arr3))
{-# INLINE izipWith3A #-}
traverseA ::
forall r ix e r' a f . (Source r' a, Manifest r e, Index ix, Applicative f)
=> (a -> f e)
-> Array r' ix a
-> f (Array r ix e)
traverseA :: (a -> f e) -> Array r' ix a -> f (Array r ix e)
traverseA a -> f e
f Array r' ix a
arr = Sz ix -> (Int -> f e) -> f (Array r ix e)
forall r ix e (f :: * -> *).
(Manifest r e, Index ix, Applicative f) =>
Sz ix -> (Int -> f e) -> f (Array r ix e)
makeArrayLinearA (Array r' ix a -> Sz ix
forall r ix e. Size r => Array r ix e -> Sz ix
size Array r' ix a
arr) (a -> f e
f (a -> f e) -> (Int -> a) -> Int -> f e
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Array r' ix a -> Int -> a
forall r e ix. (Source r e, Index ix) => Array r ix e -> Int -> e
unsafeLinearIndex Array r' ix a
arr)
{-# INLINE traverseA #-}
traverseA_ ::
forall r ix e a f. (Index ix, Source r e, Applicative f)
=> (e -> f a)
-> Array r ix e
-> f ()
traverseA_ :: (e -> f a) -> Array r ix e -> f ()
traverseA_ e -> f a
f Array r ix e
arr = Int -> (Int -> Bool) -> (Int -> Int) -> (Int -> f a) -> f ()
forall (f :: * -> *) a.
Applicative f =>
Int -> (Int -> Bool) -> (Int -> Int) -> (Int -> f a) -> f ()
loopA_ Int
0 (Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
< Sz ix -> Int
forall ix. Index ix => Sz ix -> Int
totalElem (Array r ix e -> Sz ix
forall r ix e. Size r => Array r ix e -> Sz ix
size Array r ix e
arr)) (Int -> Int -> Int
forall a. Num a => a -> a -> a
+ Int
1) (e -> f a
f (e -> f a) -> (Int -> e) -> Int -> f a
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Array r ix e -> Int -> e
forall r e ix. (Source r e, Index ix) => Array r ix e -> Int -> e
unsafeLinearIndex Array r ix e
arr)
{-# INLINE traverseA_ #-}
sequenceA ::
forall r ix e r' f. (Source r' (f e), Manifest r e, Index ix, Applicative f)
=> Array r' ix (f e)
-> f (Array r ix e)
sequenceA :: Array r' ix (f e) -> f (Array r ix e)
sequenceA = (f e -> f e) -> Array r' ix (f e) -> f (Array r ix e)
forall r ix e r' a (f :: * -> *).
(Source r' a, Manifest r e, Index ix, Applicative f) =>
(a -> f e) -> Array r' ix a -> f (Array r ix e)
traverseA f e -> f e
forall a. a -> a
id
{-# INLINE sequenceA #-}
sequenceA_ ::
forall r ix e f. (Index ix, Source r (f e), Applicative f)
=> Array r ix (f e)
-> f ()
sequenceA_ :: Array r ix (f e) -> f ()
sequenceA_ = (f e -> f e) -> Array r ix (f e) -> f ()
forall r ix e a (f :: * -> *).
(Index ix, Source r e, Applicative f) =>
(e -> f a) -> Array r ix e -> f ()
traverseA_ f e -> f e
forall a. a -> a
id
{-# INLINE sequenceA_ #-}
itraverseA ::
forall r ix e r' a f . (Source r' a, Manifest r e, Index ix, Applicative f)
=> (ix -> a -> f e)
-> Array r' ix a
-> f (Array r ix e)
itraverseA :: (ix -> a -> f e) -> Array r' ix a -> f (Array r ix e)
itraverseA ix -> a -> f e
f Array r' ix a
arr =
Comp -> Array r ix e -> Array r ix e
forall r ix e. Strategy r => Comp -> Array r ix e -> Array r ix e
setComp (Array r' ix a -> Comp
forall r ix e. Strategy r => Array r ix e -> Comp
getComp Array r' ix a
arr) (Array r ix e -> Array r ix e)
-> f (Array r ix e) -> f (Array r ix e)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> Sz ix -> (ix -> f e) -> f (Array r ix e)
forall r ix e (f :: * -> *).
(Manifest r e, Index ix, Applicative f) =>
Sz ix -> (ix -> f e) -> f (Array r ix e)
makeArrayA (Array r' ix a -> Sz ix
forall r ix e. Size r => Array r ix e -> Sz ix
size Array r' ix a
arr) (\ !ix
ix -> ix -> a -> f e
f ix
ix (Array r' ix a -> ix -> a
forall r e ix. (Source r e, Index ix) => Array r ix e -> ix -> e
unsafeIndex Array r' ix a
arr ix
ix))
{-# INLINE itraverseA #-}
itraverseA_ ::
forall r ix e a f. (Source r a, Index ix, Applicative f)
=> (ix -> a -> f e)
-> Array r ix a
-> f ()
itraverseA_ :: (ix -> a -> f e) -> Array r ix a -> f ()
itraverseA_ ix -> a -> f e
f Array r ix a
arr =
Int -> (Int -> Bool) -> (Int -> Int) -> (Int -> f e) -> f ()
forall (f :: * -> *) a.
Applicative f =>
Int -> (Int -> Bool) -> (Int -> Int) -> (Int -> f a) -> f ()
loopA_ Int
0 (Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
< Sz ix -> Int
forall ix. Index ix => Sz ix -> Int
totalElem Sz ix
sz) (Int -> Int -> Int
forall a. Num a => a -> a -> a
+ Int
1) (\ !Int
i -> ix -> a -> f e
f (Sz ix -> Int -> ix
forall ix. Index ix => Sz ix -> Int -> ix
fromLinearIndex Sz ix
sz Int
i) (Array r ix a -> Int -> a
forall r e ix. (Source r e, Index ix) => Array r ix e -> Int -> e
unsafeLinearIndex Array r ix a
arr Int
i))
where
sz :: Sz ix
sz = Array r ix a -> Sz ix
forall r ix e. Size r => Array r ix e -> Sz ix
size Array r ix a
arr
{-# INLINE itraverseA_ #-}
traversePrim ::
forall r ix b r' a m . (Source r' a, Manifest r b, Index ix, PrimMonad m)
=> (a -> m b)
-> Array r' ix a
-> m (Array r ix b)
traversePrim :: (a -> m b) -> Array r' ix a -> m (Array r ix b)
traversePrim a -> m b
f = (ix -> a -> m b) -> Array r' ix a -> m (Array r ix b)
forall r ix b r' a (m :: * -> *).
(Source r' a, Manifest r b, Index ix, PrimMonad m) =>
(ix -> a -> m b) -> Array r' ix a -> m (Array r ix b)
itraversePrim ((a -> m b) -> ix -> a -> m b
forall a b. a -> b -> a
const a -> m b
f)
{-# INLINE traversePrim #-}
itraversePrim ::
forall r ix b r' a m . (Source r' a, Manifest r b, Index ix, PrimMonad m)
=> (ix -> a -> m b)
-> Array r' ix a
-> m (Array r ix b)
itraversePrim :: (ix -> a -> m b) -> Array r' ix a -> m (Array r ix b)
itraversePrim ix -> a -> m b
f Array r' ix a
arr =
Comp -> Array r ix b -> Array r ix b
forall r ix e. Strategy r => Comp -> Array r ix e -> Array r ix e
setComp (Array r' ix a -> Comp
forall r ix e. Strategy r => Array r ix e -> Comp
getComp Array r' ix a
arr) (Array r ix b -> Array r ix b)
-> m (Array r ix b) -> m (Array r ix b)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$>
Sz ix -> (Int -> m b) -> m (Array r ix b)
forall r ix e (m :: * -> *).
(Manifest r e, Index ix, PrimMonad m) =>
Sz ix -> (Int -> m e) -> m (Array r ix e)
generateArrayLinearS
(Array r' ix a -> Sz ix
forall r ix e. Size r => Array r ix e -> Sz ix
size Array r' ix a
arr)
(\ !Int
i ->
let ix :: ix
ix = Sz ix -> Int -> ix
forall ix. Index ix => Sz ix -> Int -> ix
fromLinearIndex (Array r' ix a -> Sz ix
forall r ix e. Size r => Array r ix e -> Sz ix
size Array r' ix a
arr) Int
i
in ix -> a -> m b
f ix
ix (Array r' ix a -> Int -> a
forall r e ix. (Source r e, Index ix) => Array r ix e -> Int -> e
unsafeLinearIndex Array r' ix a
arr Int
i))
{-# INLINE itraversePrim #-}
mapM ::
forall r ix b r' a m. (Source r' a, Manifest r b, Index ix, Monad m)
=> (a -> m b)
-> Array r' ix a
-> m (Array r ix b)
mapM :: (a -> m b) -> Array r' ix a -> m (Array r ix b)
mapM = (a -> m b) -> Array r' ix a -> m (Array r ix b)
forall r ix e r' a (f :: * -> *).
(Source r' a, Manifest r e, Index ix, Applicative f) =>
(a -> f e) -> Array r' ix a -> f (Array r ix e)
traverseA
{-# INLINE mapM #-}
forM ::
forall r ix b r' a m. (Source r' a, Manifest r b, Index ix, Monad m)
=> Array r' ix a
-> (a -> m b)
-> m (Array r ix b)
forM :: Array r' ix a -> (a -> m b) -> m (Array r ix b)
forM = ((a -> m b) -> Array r' ix a -> m (Array r ix b))
-> Array r' ix a -> (a -> m b) -> m (Array r ix b)
forall a b c. (a -> b -> c) -> b -> a -> c
flip (a -> m b) -> Array r' ix a -> m (Array r ix b)
forall r ix e r' a (f :: * -> *).
(Source r' a, Manifest r e, Index ix, Applicative f) =>
(a -> f e) -> Array r' ix a -> f (Array r ix e)
traverseA
{-# INLINE forM #-}
imapM ::
forall r ix b r' a m. (Source r' a, Manifest r b, Index ix, Monad m)
=> (ix -> a -> m b)
-> Array r' ix a
-> m (Array r ix b)
imapM :: (ix -> a -> m b) -> Array r' ix a -> m (Array r ix b)
imapM = (ix -> a -> m b) -> Array r' ix a -> m (Array r ix b)
forall r ix e r' a (f :: * -> *).
(Source r' a, Manifest r e, Index ix, Applicative f) =>
(ix -> a -> f e) -> Array r' ix a -> f (Array r ix e)
itraverseA
{-# INLINE imapM #-}
iforM ::
forall r ix b r' a m. (Source r' a, Manifest r b, Index ix, Monad m)
=> Array r' ix a
-> (ix -> a -> m b)
-> m (Array r ix b)
iforM :: Array r' ix a -> (ix -> a -> m b) -> m (Array r ix b)
iforM = ((ix -> a -> m b) -> Array r' ix a -> m (Array r ix b))
-> Array r' ix a -> (ix -> a -> m b) -> m (Array r ix b)
forall a b c. (a -> b -> c) -> b -> a -> c
flip (ix -> a -> m b) -> Array r' ix a -> m (Array r ix b)
forall r ix e r' a (f :: * -> *).
(Source r' a, Manifest r e, Index ix, Applicative f) =>
(ix -> a -> f e) -> Array r' ix a -> f (Array r ix e)
itraverseA
{-# INLINE iforM #-}
mapM_ :: (Source r a, Index ix, Monad m) => (a -> m b) -> Array r ix a -> m ()
mapM_ :: (a -> m b) -> Array r ix a -> m ()
mapM_ a -> m b
f !Array r ix a
arr = ix -> ix -> ix -> (Int -> Int -> Bool) -> (ix -> m b) -> m ()
forall ix (m :: * -> *) a.
(Index ix, Monad m) =>
ix -> ix -> ix -> (Int -> Int -> Bool) -> (ix -> m a) -> m ()
iterM_ ix
forall ix. Index ix => ix
zeroIndex (Sz ix -> ix
forall ix. Sz ix -> ix
unSz (Array r ix a -> Sz ix
forall r ix e. Size r => Array r ix e -> Sz ix
size Array r ix a
arr)) (Int -> ix
forall ix. Index ix => Int -> ix
pureIndex Int
1) Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
(<) (a -> m b
f (a -> m b) -> (ix -> a) -> ix -> m b
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Array r ix a -> ix -> a
forall r e ix. (Source r e, Index ix) => Array r ix e -> ix -> e
unsafeIndex Array r ix a
arr)
{-# INLINE mapM_ #-}
forM_ :: (Source r a, Index ix, Monad m) => Array r ix a -> (a -> m b) -> m ()
forM_ :: Array r ix a -> (a -> m b) -> m ()
forM_ = ((a -> m b) -> Array r ix a -> m ())
-> Array r ix a -> (a -> m b) -> m ()
forall a b c. (a -> b -> c) -> b -> a -> c
flip (a -> m b) -> Array r ix a -> m ()
forall r a ix (m :: * -> *) b.
(Source r a, Index ix, Monad m) =>
(a -> m b) -> Array r ix a -> m ()
mapM_
{-# INLINE forM_ #-}
iforM_ :: (Source r a, Index ix, Monad m) => Array r ix a -> (ix -> a -> m b) -> m ()
iforM_ :: Array r ix a -> (ix -> a -> m b) -> m ()
iforM_ = ((ix -> a -> m b) -> Array r ix a -> m ())
-> Array r ix a -> (ix -> a -> m b) -> m ()
forall a b c. (a -> b -> c) -> b -> a -> c
flip (ix -> a -> m b) -> Array r ix a -> m ()
forall ix r a (m :: * -> *) b.
(Index ix, Source r a, Monad m) =>
(ix -> a -> m b) -> Array r ix a -> m ()
imapM_
{-# INLINE iforM_ #-}
mapIO ::
forall r ix b r' a m. (Size r', Load r' ix a, Manifest r b, MonadUnliftIO m)
=> (a -> m b)
-> Array r' ix a
-> m (Array r ix b)
mapIO :: (a -> m b) -> Array r' ix a -> m (Array r ix b)
mapIO a -> m b
action = (ix -> a -> m b) -> Array r' ix a -> m (Array r ix b)
forall r ix b r' a (m :: * -> *).
(Size r', Load r' ix a, Manifest r b, MonadUnliftIO m) =>
(ix -> a -> m b) -> Array r' ix a -> m (Array r ix b)
imapIO ((a -> m b) -> ix -> a -> m b
forall a b. a -> b -> a
const a -> m b
action)
{-# INLINE mapIO #-}
mapIO_ ::
forall r ix e a m. (Load r ix e, MonadUnliftIO m)
=> (e -> m a)
-> Array r ix e
-> m ()
mapIO_ :: (e -> m a) -> Array r ix e -> m ()
mapIO_ e -> m a
action Array r ix e
arr =
((forall a. m a -> IO a) -> IO ()) -> m ()
forall (m :: * -> *) b.
MonadUnliftIO m =>
((forall a. m a -> IO a) -> IO b) -> m b
withRunInIO (((forall a. m a -> IO a) -> IO ()) -> m ())
-> ((forall a. m a -> IO a) -> IO ()) -> m ()
forall a b. (a -> b) -> a -> b
$ \forall a. m a -> IO a
run ->
Comp -> (Scheduler RealWorld () -> IO ()) -> IO ()
withMassivScheduler_ (Array r ix e -> Comp
forall r ix e. Strategy r => Array r ix e -> Comp
getComp Array r ix e
arr) ((Scheduler RealWorld () -> IO ()) -> IO ())
-> (Scheduler RealWorld () -> IO ()) -> IO ()
forall a b. (a -> b) -> a -> b
$ \Scheduler RealWorld ()
scheduler ->
Scheduler RealWorld ()
-> Array r ix e -> (Int -> e -> IO ()) -> IO ()
forall r ix e (m :: * -> *) s.
(Load r ix e, MonadPrimBase s m) =>
Scheduler s () -> Array r ix e -> (Int -> e -> m ()) -> m ()
iterArrayLinearM_ Scheduler RealWorld ()
scheduler Array r ix e
arr (\Int
_ -> IO a -> IO ()
forall (f :: * -> *) a. Functor f => f a -> f ()
void (IO a -> IO ()) -> (e -> IO a) -> e -> IO ()
forall b c a. (b -> c) -> (a -> b) -> a -> c
. m a -> IO a
forall a. m a -> IO a
run (m a -> IO a) -> (e -> m a) -> e -> IO a
forall b c a. (b -> c) -> (a -> b) -> a -> c
. e -> m a
action)
{-# INLINE mapIO_ #-}
imapIO_ ::
forall r ix e a m. (Load r ix e, MonadUnliftIO m)
=> (ix -> e -> m a)
-> Array r ix e
-> m ()
imapIO_ :: (ix -> e -> m a) -> Array r ix e -> m ()
imapIO_ ix -> e -> m a
action Array r ix e
arr =
((forall a. m a -> IO a) -> IO ()) -> m ()
forall (m :: * -> *) b.
MonadUnliftIO m =>
((forall a. m a -> IO a) -> IO b) -> m b
withRunInIO (((forall a. m a -> IO a) -> IO ()) -> m ())
-> ((forall a. m a -> IO a) -> IO ()) -> m ()
forall a b. (a -> b) -> a -> b
$ \forall a. m a -> IO a
run ->
Comp -> (Scheduler RealWorld () -> IO ()) -> IO ()
withMassivScheduler_ (Array r ix e -> Comp
forall r ix e. Strategy r => Array r ix e -> Comp
getComp Array r ix e
arr) ((Scheduler RealWorld () -> IO ()) -> IO ())
-> (Scheduler RealWorld () -> IO ()) -> IO ()
forall a b. (a -> b) -> a -> b
$ \Scheduler RealWorld ()
scheduler ->
let sz :: Sz ix
sz = Array r ix e -> Sz ix
forall r ix e. Shape r ix => Array r ix e -> Sz ix
outerSize Array r ix e
arr
in Scheduler RealWorld ()
-> Array r ix e -> (Int -> e -> IO ()) -> IO ()
forall r ix e (m :: * -> *) s.
(Load r ix e, MonadPrimBase s m) =>
Scheduler s () -> Array r ix e -> (Int -> e -> m ()) -> m ()
iterArrayLinearM_ Scheduler RealWorld ()
scheduler Array r ix e
arr (\Int
i -> IO a -> IO ()
forall (f :: * -> *) a. Functor f => f a -> f ()
void (IO a -> IO ()) -> (e -> IO a) -> e -> IO ()
forall b c a. (b -> c) -> (a -> b) -> a -> c
. m a -> IO a
forall a. m a -> IO a
run (m a -> IO a) -> (e -> m a) -> e -> IO a
forall b c a. (b -> c) -> (a -> b) -> a -> c
. ix -> e -> m a
action (Sz ix -> Int -> ix
forall ix. Index ix => Sz ix -> Int -> ix
fromLinearIndex Sz ix
sz Int
i))
{-# INLINE imapIO_ #-}
imapIO ::
forall r ix b r' a m. (Size r', Load r' ix a, Manifest r b, MonadUnliftIO m)
=> (ix -> a -> m b)
-> Array r' ix a
-> m (Array r ix b)
imapIO :: (ix -> a -> m b) -> Array r' ix a -> m (Array r ix b)
imapIO ix -> a -> m b
action Array r' ix a
arr = do
let sz :: Sz ix
sz = Array r' ix a -> Sz ix
forall r ix e. Size r => Array r ix e -> Sz ix
size Array r' ix a
arr
((forall a. m a -> IO a) -> IO (Array r ix b)) -> m (Array r ix b)
forall (m :: * -> *) b.
MonadUnliftIO m =>
((forall a. m a -> IO a) -> IO b) -> m b
withRunInIO (((forall a. m a -> IO a) -> IO (Array r ix b))
-> m (Array r ix b))
-> ((forall a. m a -> IO a) -> IO (Array r ix b))
-> m (Array r ix b)
forall a b. (a -> b) -> a -> b
$ \forall a. m a -> IO a
run -> do
MArray RealWorld r ix b
marr <- Sz ix -> IO (MArray (PrimState IO) r ix b)
forall r e ix (m :: * -> *).
(Manifest r e, Index ix, PrimMonad m) =>
Sz ix -> m (MArray (PrimState m) r ix e)
unsafeNew Sz ix
sz
Comp -> (Scheduler RealWorld () -> IO ()) -> IO ()
withMassivScheduler_ (Array r' ix a -> Comp
forall r ix e. Strategy r => Array r ix e -> Comp
getComp Array r' ix a
arr) ((Scheduler RealWorld () -> IO ()) -> IO ())
-> (Scheduler RealWorld () -> IO ()) -> IO ()
forall a b. (a -> b) -> a -> b
$ \Scheduler RealWorld ()
scheduler ->
Scheduler RealWorld ()
-> Array r' ix a -> (Int -> a -> IO ()) -> IO ()
forall r ix e (m :: * -> *) s.
(Load r ix e, MonadPrimBase s m) =>
Scheduler s () -> Array r ix e -> (Int -> e -> m ()) -> m ()
iterArrayLinearM_ Scheduler RealWorld ()
scheduler Array r' ix a
arr ((Int -> a -> IO ()) -> IO ()) -> (Int -> a -> IO ()) -> IO ()
forall a b. (a -> b) -> a -> b
$ \ !Int
i a
e ->
m b -> IO b
forall a. m a -> IO a
run (ix -> a -> m b
action (Sz ix -> Int -> ix
forall ix. Index ix => Sz ix -> Int -> ix
fromLinearIndex Sz ix
sz Int
i) a
e) IO b -> (b -> IO ()) -> IO ()
forall (m :: * -> *) a b. Monad m => m a -> (a -> m b) -> m b
>>= MArray (PrimState IO) r ix b -> Int -> b -> IO ()
forall r e ix (m :: * -> *).
(Manifest r e, Index ix, PrimMonad m) =>
MArray (PrimState m) r ix e -> Int -> e -> m ()
unsafeLinearWrite MArray RealWorld r ix b
MArray (PrimState IO) r ix b
marr Int
i
Comp -> MArray (PrimState IO) r ix b -> IO (Array r ix b)
forall r e ix (m :: * -> *).
(Manifest r e, Index ix, PrimMonad m) =>
Comp -> MArray (PrimState m) r ix e -> m (Array r ix e)
unsafeFreeze (Array r' ix a -> Comp
forall r ix e. Strategy r => Array r ix e -> Comp
getComp Array r' ix a
arr) MArray RealWorld r ix b
MArray (PrimState IO) r ix b
marr
{-# INLINE imapIO #-}
forIO ::
forall r ix b r' a m. (Size r', Load r' ix a, Manifest r b, MonadUnliftIO m)
=> Array r' ix a
-> (a -> m b)
-> m (Array r ix b)
forIO :: Array r' ix a -> (a -> m b) -> m (Array r ix b)
forIO = ((a -> m b) -> Array r' ix a -> m (Array r ix b))
-> Array r' ix a -> (a -> m b) -> m (Array r ix b)
forall a b c. (a -> b -> c) -> b -> a -> c
flip (a -> m b) -> Array r' ix a -> m (Array r ix b)
forall r ix b r' a (m :: * -> *).
(Size r', Load r' ix a, Manifest r b, MonadUnliftIO m) =>
(a -> m b) -> Array r' ix a -> m (Array r ix b)
mapIO
{-# INLINE forIO #-}
imapWS ::
forall r ix b r' a s m. (Source r' a, Manifest r b, Index ix, MonadUnliftIO m, PrimMonad m)
=> WorkerStates s
-> (ix -> a -> s -> m b)
-> Array r' ix a
-> m (Array r ix b)
imapWS :: WorkerStates s
-> (ix -> a -> s -> m b) -> Array r' ix a -> m (Array r ix b)
imapWS WorkerStates s
states ix -> a -> s -> m b
f Array r' ix a
arr = WorkerStates s -> Sz ix -> (ix -> s -> m b) -> m (Array r ix b)
forall r ix e s (m :: * -> *).
(Manifest r e, Index ix, MonadUnliftIO m, PrimMonad m) =>
WorkerStates s -> Sz ix -> (ix -> s -> m e) -> m (Array r ix e)
generateArrayWS WorkerStates s
states (Array r' ix a -> Sz ix
forall r ix e. Size r => Array r ix e -> Sz ix
size Array r' ix a
arr) (\ix
ix s
s -> ix -> a -> s -> m b
f ix
ix (Array r' ix a -> ix -> a
forall r e ix. (Source r e, Index ix) => Array r ix e -> ix -> e
unsafeIndex Array r' ix a
arr ix
ix) s
s)
{-# INLINE imapWS #-}
mapWS ::
forall r ix b r' a s m. (Source r' a, Manifest r b, Index ix, MonadUnliftIO m, PrimMonad m)
=> WorkerStates s
-> (a -> s -> m b)
-> Array r' ix a
-> m (Array r ix b)
mapWS :: WorkerStates s
-> (a -> s -> m b) -> Array r' ix a -> m (Array r ix b)
mapWS WorkerStates s
states a -> s -> m b
f = WorkerStates s
-> (ix -> a -> s -> m b) -> Array r' ix a -> m (Array r ix b)
forall r ix b r' a s (m :: * -> *).
(Source r' a, Manifest r b, Index ix, MonadUnliftIO m,
PrimMonad m) =>
WorkerStates s
-> (ix -> a -> s -> m b) -> Array r' ix a -> m (Array r ix b)
imapWS WorkerStates s
states (\ ix
_ -> a -> s -> m b
f)
{-# INLINE mapWS #-}
iforWS ::
forall r ix b r' a s m. (Source r' a, Manifest r b, Index ix, MonadUnliftIO m, PrimMonad m)
=> WorkerStates s
-> Array r' ix a
-> (ix -> a -> s -> m b)
-> m (Array r ix b)
iforWS :: WorkerStates s
-> Array r' ix a -> (ix -> a -> s -> m b) -> m (Array r ix b)
iforWS WorkerStates s
states Array r' ix a
f ix -> a -> s -> m b
arr = WorkerStates s
-> (ix -> a -> s -> m b) -> Array r' ix a -> m (Array r ix b)
forall r ix b r' a s (m :: * -> *).
(Source r' a, Manifest r b, Index ix, MonadUnliftIO m,
PrimMonad m) =>
WorkerStates s
-> (ix -> a -> s -> m b) -> Array r' ix a -> m (Array r ix b)
imapWS WorkerStates s
states ix -> a -> s -> m b
arr Array r' ix a
f
{-# INLINE iforWS #-}
forWS ::
forall r ix b r' a s m. (Source r' a, Manifest r b, Index ix, MonadUnliftIO m, PrimMonad m)
=> WorkerStates s
-> Array r' ix a
-> (a -> s -> m b)
-> m (Array r ix b)
forWS :: WorkerStates s
-> Array r' ix a -> (a -> s -> m b) -> m (Array r ix b)
forWS WorkerStates s
states Array r' ix a
arr a -> s -> m b
f = WorkerStates s
-> (ix -> a -> s -> m b) -> Array r' ix a -> m (Array r ix b)
forall r ix b r' a s (m :: * -> *).
(Source r' a, Manifest r b, Index ix, MonadUnliftIO m,
PrimMonad m) =>
WorkerStates s
-> (ix -> a -> s -> m b) -> Array r' ix a -> m (Array r ix b)
imapWS WorkerStates s
states (\ ix
_ -> a -> s -> m b
f) Array r' ix a
arr
{-# INLINE forWS #-}
forIO_ :: (Load r ix e, MonadUnliftIO m) => Array r ix e -> (e -> m a) -> m ()
forIO_ :: Array r ix e -> (e -> m a) -> m ()
forIO_ = ((e -> m a) -> Array r ix e -> m ())
-> Array r ix e -> (e -> m a) -> m ()
forall a b c. (a -> b -> c) -> b -> a -> c
flip (e -> m a) -> Array r ix e -> m ()
forall r ix e a (m :: * -> *).
(Load r ix e, MonadUnliftIO m) =>
(e -> m a) -> Array r ix e -> m ()
mapIO_
{-# INLINE forIO_ #-}
iforIO ::
forall r ix b r' a m. (Size r', Load r' ix a, Manifest r b, MonadUnliftIO m)
=> Array r' ix a
-> (ix -> a -> m b)
-> m (Array r ix b)
iforIO :: Array r' ix a -> (ix -> a -> m b) -> m (Array r ix b)
iforIO = ((ix -> a -> m b) -> Array r' ix a -> m (Array r ix b))
-> Array r' ix a -> (ix -> a -> m b) -> m (Array r ix b)
forall a b c. (a -> b -> c) -> b -> a -> c
flip (ix -> a -> m b) -> Array r' ix a -> m (Array r ix b)
forall r ix b r' a (m :: * -> *).
(Size r', Load r' ix a, Manifest r b, MonadUnliftIO m) =>
(ix -> a -> m b) -> Array r' ix a -> m (Array r ix b)
imapIO
{-# INLINE iforIO #-}
iforIO_ ::
forall r ix e a m. (Load r ix e, MonadUnliftIO m)
=> Array r ix e
-> (ix -> e -> m a)
-> m ()
iforIO_ :: Array r ix e -> (ix -> e -> m a) -> m ()
iforIO_ = ((ix -> e -> m a) -> Array r ix e -> m ())
-> Array r ix e -> (ix -> e -> m a) -> m ()
forall a b c. (a -> b -> c) -> b -> a -> c
flip (ix -> e -> m a) -> Array r ix e -> m ()
forall r ix e a (m :: * -> *).
(Load r ix e, MonadUnliftIO m) =>
(ix -> e -> m a) -> Array r ix e -> m ()
imapIO_
{-# INLINE iforIO_ #-}
iterArrayLinearM_ ::
forall r ix e m s. (Load r ix e, MonadPrimBase s m)
=> Scheduler s ()
-> Array r ix e
-> (Int -> e -> m ())
-> m ()
iterArrayLinearM_ :: Scheduler s () -> Array r ix e -> (Int -> e -> m ()) -> m ()
iterArrayLinearM_ Scheduler s ()
scheduler Array r ix e
arr Int -> e -> m ()
f =
ST (PrimState m) () -> m ()
forall (m :: * -> *) a. PrimMonad m => ST (PrimState m) a -> m a
stToPrim (ST (PrimState m) () -> m ()) -> ST (PrimState m) () -> m ()
forall a b. (a -> b) -> a -> b
$ Scheduler s () -> Array r ix e -> (Int -> e -> ST s ()) -> ST s ()
forall r ix e s.
Load r ix e =>
Scheduler s () -> Array r ix e -> (Int -> e -> ST s ()) -> ST s ()
iterArrayLinearST_ Scheduler s ()
scheduler Array r ix e
arr (\Int
i -> m () -> ST s ()
forall (m1 :: * -> *) (m2 :: * -> *) a.
(PrimBase m1, PrimMonad m2, PrimState m1 ~ PrimState m2) =>
m1 a -> m2 a
primToPrim (m () -> ST s ()) -> (e -> m ()) -> e -> ST s ()
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Int -> e -> m ()
f Int
i)
{-# INLINE iterArrayLinearM_ #-}
iterArrayLinearWithSetM_ ::
forall r ix e m s. (Load r ix e, MonadPrimBase s m)
=> Scheduler s ()
-> Array r ix e
-> (Int -> e -> m ())
-> (Ix1 -> Sz1 -> e -> m ())
-> m ()
iterArrayLinearWithSetM_ :: Scheduler s ()
-> Array r ix e
-> (Int -> e -> m ())
-> (Int -> Sz1 -> e -> m ())
-> m ()
iterArrayLinearWithSetM_ Scheduler s ()
scheduler Array r ix e
arr Int -> e -> m ()
f Int -> Sz1 -> e -> m ()
set =
ST (PrimState m) () -> m ()
forall (m :: * -> *) a. PrimMonad m => ST (PrimState m) a -> m a
stToPrim (ST (PrimState m) () -> m ()) -> ST (PrimState m) () -> m ()
forall a b. (a -> b) -> a -> b
$
Scheduler s ()
-> Array r ix e
-> (Int -> e -> ST s ())
-> (Int -> Sz1 -> e -> ST s ())
-> ST s ()
forall r ix e s.
Load r ix e =>
Scheduler s ()
-> Array r ix e
-> (Int -> e -> ST s ())
-> (Int -> Sz1 -> e -> ST s ())
-> ST s ()
iterArrayLinearWithSetST_ Scheduler s ()
scheduler Array r ix e
arr (\Int
i -> m () -> ST s ()
forall (m1 :: * -> *) (m2 :: * -> *) a.
(PrimBase m1, PrimMonad m2, PrimState m1 ~ PrimState m2) =>
m1 a -> m2 a
primToPrim (m () -> ST s ()) -> (e -> m ()) -> e -> ST s ()
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Int -> e -> m ()
f Int
i) (\Int
i Sz1
n -> m () -> ST s ()
forall (m1 :: * -> *) (m2 :: * -> *) a.
(PrimBase m1, PrimMonad m2, PrimState m1 ~ PrimState m2) =>
m1 a -> m2 a
primToPrim (m () -> ST s ()) -> (e -> m ()) -> e -> ST s ()
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Int -> Sz1 -> e -> m ()
set Int
i Sz1
n)
{-# INLINE iterArrayLinearWithSetM_ #-}
iterArrayLinearWithStrideM_ ::
forall r ix e m s. (StrideLoad r ix e, MonadPrimBase s m)
=> Scheduler s ()
-> Stride ix
-> Sz ix
-> Array r ix e
-> (Int -> e -> m ())
-> m ()
iterArrayLinearWithStrideM_ :: Scheduler s ()
-> Stride ix -> Sz ix -> Array r ix e -> (Int -> e -> m ()) -> m ()
iterArrayLinearWithStrideM_ Scheduler s ()
scheduler Stride ix
stride Sz ix
sz Array r ix e
arr Int -> e -> m ()
f =
ST (PrimState m) () -> m ()
forall (m :: * -> *) a. PrimMonad m => ST (PrimState m) a -> m a
stToPrim (ST (PrimState m) () -> m ()) -> ST (PrimState m) () -> m ()
forall a b. (a -> b) -> a -> b
$ Scheduler s ()
-> Stride ix
-> Sz ix
-> Array r ix e
-> (Int -> e -> ST s ())
-> ST s ()
forall r ix e s.
StrideLoad r ix e =>
Scheduler s ()
-> Stride ix
-> Sz ix
-> Array r ix e
-> (Int -> e -> ST s ())
-> ST s ()
iterArrayLinearWithStrideST_ Scheduler s ()
scheduler Stride ix
stride Sz ix
sz Array r ix e
arr (\Int
i -> m () -> ST s ()
forall (m1 :: * -> *) (m2 :: * -> *) a.
(PrimBase m1, PrimMonad m2, PrimState m1 ~ PrimState m2) =>
m1 a -> m2 a
primToPrim (m () -> ST s ()) -> (e -> m ()) -> e -> ST s ()
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Int -> e -> m ()
f Int
i)
{-# INLINE iterArrayLinearWithStrideM_ #-}
imapSchedulerM_ ::
(Index ix, Source r e, MonadPrimBase s m)
=> Scheduler s ()
-> (ix -> e -> m a)
-> Array r ix e
-> m ()
imapSchedulerM_ :: Scheduler s () -> (ix -> e -> m a) -> Array r ix e -> m ()
imapSchedulerM_ Scheduler s ()
scheduler ix -> e -> m a
action Array r ix e
arr = do
let sz :: Sz ix
sz = Array r ix e -> Sz ix
forall r ix e. Size r => Array r ix e -> Sz ix
size Array r ix e
arr
Scheduler s () -> Int -> (Int -> e) -> (Int -> e -> m ()) -> m ()
forall s (m :: * -> *) b.
MonadPrimBase s m =>
Scheduler s () -> Int -> (Int -> b) -> (Int -> b -> m ()) -> m ()
splitLinearlyWith_
Scheduler s ()
scheduler
(Sz ix -> Int
forall ix. Index ix => Sz ix -> Int
totalElem Sz ix
sz)
(Array r ix e -> Int -> e
forall r e ix. (Source r e, Index ix) => Array r ix e -> Int -> e
unsafeLinearIndex Array r ix e
arr)
(\Int
i -> m a -> m ()
forall (f :: * -> *) a. Functor f => f a -> f ()
void (m a -> m ()) -> (e -> m a) -> e -> m ()
forall b c a. (b -> c) -> (a -> b) -> a -> c
. ix -> e -> m a
action (Sz ix -> Int -> ix
forall ix. Index ix => Sz ix -> Int -> ix
fromLinearIndex Sz ix
sz Int
i))
{-# INLINE imapSchedulerM_ #-}
iforSchedulerM_ ::
(Index ix, Source r e, MonadPrimBase s m)
=> Scheduler s ()
-> Array r ix e
-> (ix -> e -> m a)
-> m ()
iforSchedulerM_ :: Scheduler s () -> Array r ix e -> (ix -> e -> m a) -> m ()
iforSchedulerM_ Scheduler s ()
scheduler Array r ix e
arr ix -> e -> m a
action = Scheduler s () -> (ix -> e -> m a) -> Array r ix e -> m ()
forall ix r e s (m :: * -> *) a.
(Index ix, Source r e, MonadPrimBase s m) =>
Scheduler s () -> (ix -> e -> m a) -> Array r ix e -> m ()
imapSchedulerM_ Scheduler s ()
scheduler ix -> e -> m a
action Array r ix e
arr
{-# INLINE iforSchedulerM_ #-}