module VectorExtras.Basics.Generic where

import Data.Vector.Generic
import qualified Data.Vector.Generic.Mutable as Mut
import qualified VectorExtras.Generic.Mutable as Mut
import VectorExtras.Prelude

-- |
-- Notice: It is your responsibility to ensure that the indices
-- in the assoc list are within bounds.
fromAssocListWithGen :: (Vector v a) => Int -> (Int -> a) -> [(Int, a)] -> v a
fromAssocListWithGen :: forall (v :: * -> *) a.
Vector v a =>
Int -> (Int -> a) -> [(Int, a)] -> v a
fromAssocListWithGen Int
size Int -> a
genDefVal [(Int, a)]
list =
  forall a. (forall s. ST s a) -> a
runST forall a b. (a -> b) -> a -> b
$ do
    Mutable v s a
mv <- forall (m :: * -> *) (v :: * -> * -> *) a.
(PrimMonad m, MVector v a) =>
Int -> (Int -> a) -> m (v (PrimState m) a)
Mut.generate Int
size Int -> a
genDefVal
    forall (v :: * -> * -> *) a s.
MVector v a =>
v s a -> [(Int, a)] -> ST s ()
Mut.writeAssocList Mutable v s a
mv [(Int, a)]
list
    forall (m :: * -> *) (v :: * -> *) a.
(PrimMonad m, Vector v a) =>
Mutable v (PrimState m) a -> m (v a)
unsafeFreeze Mutable v s a
mv

-- |
-- Notice: It is your responsibility to ensure that the indices
-- in the assoc list are within bounds.
fromAssocListWithDef :: (Vector v a) => Int -> a -> [(Int, a)] -> v a
fromAssocListWithDef :: forall (v :: * -> *) a. Vector v a => Int -> a -> [(Int, a)] -> v a
fromAssocListWithDef Int
size a
defVal [(Int, a)]
list =
  forall a. (forall s. ST s a) -> a
runST forall a b. (a -> b) -> a -> b
$ do
    Mutable v s a
mv <- forall (m :: * -> *) (v :: * -> * -> *) a.
(PrimMonad m, MVector v a) =>
Int -> a -> m (v (PrimState m) a)
Mut.replicate Int
size a
defVal
    forall (v :: * -> * -> *) a s.
MVector v a =>
v s a -> [(Int, a)] -> ST s ()
Mut.writeAssocList Mutable v s a
mv [(Int, a)]
list
    forall (m :: * -> *) (v :: * -> *) a.
(PrimMonad m, Vector v a) =>
Mutable v (PrimState m) a -> m (v a)
unsafeFreeze Mutable v s a
mv

-- |
-- >>> fromReverseListN 3 [1,2,3] :: Data.Vector.Vector Int
-- [3,2,1]
{-# INLINE fromReverseListN #-}
fromReverseListN :: (Vector v a) => Int -> [a] -> v a
fromReverseListN :: forall (v :: * -> *) a. Vector v a => Int -> [a] -> v a
fromReverseListN Int
size [a]
list =
  forall (v :: * -> *) a.
Vector v a =>
Int -> (forall s. Mutable v s a -> ST s ()) -> v a
initialized Int
size forall a b. (a -> b) -> a -> b
$ \Mutable v s a
mv -> forall (v :: * -> * -> *) a s.
MVector v a =>
v s a -> Int -> [a] -> ST s ()
Mut.writeListInReverseOrderStartingFrom Mutable v s a
mv (forall a. Enum a => a -> a
pred Int
size) [a]
list

{-# INLINE initialized #-}
initialized :: (Vector v a) => Int -> (forall s. Mutable v s a -> ST s ()) -> v a
initialized :: forall (v :: * -> *) a.
Vector v a =>
Int -> (forall s. Mutable v s a -> ST s ()) -> v a
initialized Int
size forall s. Mutable v s a -> ST s ()
initialize = forall a. (forall s. ST s a) -> a
runST forall a b. (a -> b) -> a -> b
$ do
  Mutable v s a
mv <- forall (m :: * -> *) (v :: * -> * -> *) a.
(PrimMonad m, MVector v a) =>
Int -> m (v (PrimState m) a)
Mut.unsafeNew Int
size
  forall s. Mutable v s a -> ST s ()
initialize Mutable v s a
mv
  forall (m :: * -> *) (v :: * -> *) a.
(PrimMonad m, Vector v a) =>
Mutable v (PrimState m) a -> m (v a)
unsafeFreeze Mutable v s a
mv