module Data.Vector.Fixed.Mutable (
Arity
, arity
, Mutable
, DimM
, MVector(..)
, lengthM
, read
, write
, clone
, IVector(..)
, index
, lengthI
, freeze
, thaw
, constructVec
, inspectVec
) where
import Control.Monad.ST
import Control.Monad.Primitive
import Data.Vector.Fixed.Cont (Dim,Arity,Fun(..),S,Vector(..),arity,apply,accum)
import Prelude hiding (read)
type family Mutable (v :: * -> *) :: * -> * -> *
type family DimM (v :: * -> * -> *) :: *
class (Arity (DimM v)) => MVector v a where
overlaps :: v s a -> v s a -> Bool
copy :: PrimMonad m
=> v (PrimState m) a
-> v (PrimState m) a
-> m ()
move :: PrimMonad m
=> v (PrimState m) a
-> v (PrimState m) a
-> m ()
new :: PrimMonad m => m (v (PrimState m) a)
unsafeRead :: PrimMonad m => v (PrimState m) a -> Int -> m a
unsafeWrite :: PrimMonad m => v (PrimState m) a -> Int -> a -> m ()
lengthM :: forall v s a. (Arity (DimM v)) => v s a -> Int
lengthM _ = arity (undefined :: DimM v)
clone :: (PrimMonad m, MVector v a) => v (PrimState m) a -> m (v (PrimState m) a)
clone v = do
u <- new
move v u
return u
read :: (PrimMonad m, MVector v a) => v (PrimState m) a -> Int -> m a
read v i
| i < 0 || i >= lengthM v = error "Data.Vector.Fixed.Mutable.read: index out of range"
| otherwise = unsafeRead v i
write :: (PrimMonad m, MVector v a) => v (PrimState m) a -> Int -> a -> m ()
write v i x
| i < 0 || i >= lengthM v = error "Data.Vector.Fixed.Mutable.write: index out of range"
| otherwise = unsafeWrite v i x
class (Dim v ~ DimM (Mutable v), MVector (Mutable v) a) => IVector v a where
unsafeFreeze :: PrimMonad m => Mutable v (PrimState m) a -> m (v a)
unsafeThaw :: PrimMonad m => v a -> m (Mutable v (PrimState m) a)
unsafeIndex :: v a -> Int -> a
lengthI :: IVector v a => v a -> Int
lengthI = lengthM . cast
where
cast :: v a -> Mutable v () a
cast _ = undefined
index :: IVector v a => v a -> Int -> a
index v i | i < 0 || i >= lengthI v = error "Data.Vector.Fixed.Mutable.!: index out of bounds"
| otherwise = unsafeIndex v i
freeze :: (PrimMonad m, IVector v a) => Mutable v (PrimState m) a -> m (v a)
freeze v = unsafeFreeze =<< clone v
thaw :: (PrimMonad m, IVector v a) => v a -> m (Mutable v (PrimState m) a)
thaw v = clone =<< unsafeThaw v
inspectVec :: forall v a b. (Arity (Dim v), IVector v a) => v a -> Fun (Dim v) a b -> b
inspectVec v
= inspect
$ apply (\(T_idx i) -> (unsafeIndex v i, T_idx (i+1)))
(T_idx 0)
newtype T_idx n = T_idx Int
constructVec :: forall v a. (Arity (Dim v), IVector v a) => Fun (Dim v) a (v a)
constructVec =
accum step
(\(T_new _ st) -> runST $ unsafeFreeze =<< st :: v a)
(T_new 0 new :: T_new v a (Dim v))
data T_new v a n = T_new Int (forall s. ST s (Mutable v s a))
step :: (IVector v a) => T_new v a (S n) -> a -> T_new v a n
step (T_new i st) x = T_new (i+1) $ do
mv <- st
unsafeWrite mv i x
return mv