{-# LANGUAGE FlexibleContexts #-}
module Data.Massiv.Vector.Unsafe
(
unsafeHead
, unsafeLast
, unsafeIndexM
, unsafeHeadM
, unsafeLastM
, unsafeInit
, unsafeTail
, unsafeTake
, unsafeDrop
, unsafeUnfoldrN
, unsafeUnfoldrNM
, unsafeFromListN
) where
import Data.Coerce
import Data.Massiv.Core.Common
import Data.Massiv.Array.Delayed.Stream
import qualified Data.Massiv.Vector.Stream as S
unsafeHead :: Source r Ix1 e => Vector r e -> e
unsafeHead :: Vector r e -> e
unsafeHead = (Vector r e -> Int -> e
forall r ix e. Source r ix e => Array r ix e -> Int -> e
`unsafeLinearIndex` Int
0)
{-# INLINE unsafeHead #-}
unsafeLast :: Source r Ix1 e => Vector r e -> e
unsafeLast :: Vector r e -> e
unsafeLast Vector r e
v = Vector r e -> Int -> e
forall r ix e. Source r ix e => Array r ix e -> Int -> e
unsafeLinearIndex Vector r e
v (Int -> Int -> Int
forall a. Ord a => a -> a -> a
max Int
0 (Sz Int -> Int
forall ix. Sz ix -> ix
unSz (Vector r e -> Sz Int
forall r ix e. Load r ix e => Array r ix e -> Sz ix
size Vector r e
v) Int -> Int -> Int
forall a. Num a => a -> a -> a
- Int
1))
{-# INLINE unsafeLast #-}
unsafeIndexM :: (Source r Ix1 e, Monad m) => Vector r e -> Ix1 -> m e
unsafeIndexM :: Vector r e -> Int -> m e
unsafeIndexM Vector r e
v Int
i = e -> m e
forall (f :: * -> *) a. Applicative f => a -> f a
pure (e -> m e) -> e -> m e
forall a b. (a -> b) -> a -> b
$! Vector r e -> Int -> e
forall r ix e. Source r ix e => Array r ix e -> Int -> e
unsafeLinearIndex Vector r e
v Int
i
{-# INLINE unsafeIndexM #-}
unsafeHeadM :: Monad m => Source r Ix1 e => Vector r e -> m e
unsafeHeadM :: Vector r e -> m e
unsafeHeadM Vector r e
v = e -> m e
forall (f :: * -> *) a. Applicative f => a -> f a
pure (e -> m e) -> e -> m e
forall a b. (a -> b) -> a -> b
$! Vector r e -> e
forall r e. Source r Int e => Vector r e -> e
unsafeHead Vector r e
v
{-# INLINE unsafeHeadM #-}
unsafeLastM :: Monad m => Source r Ix1 e => Vector r e -> m e
unsafeLastM :: Vector r e -> m e
unsafeLastM Vector r e
v = e -> m e
forall (f :: * -> *) a. Applicative f => a -> f a
pure (e -> m e) -> e -> m e
forall a b. (a -> b) -> a -> b
$! Vector r e -> e
forall r e. Source r Int e => Vector r e -> e
unsafeLast Vector r e
v
{-# INLINE unsafeLastM #-}
unsafeInit :: Source r Ix1 e => Vector r e -> Vector r e
unsafeInit :: Vector r e -> Vector r e
unsafeInit Vector r e
v = Int -> Sz Int -> Vector r e -> Vector r e
forall r ix e.
Source r ix e =>
Int -> Sz Int -> Array r ix e -> Array r Int e
unsafeLinearSlice Int
0 (Int -> Sz Int
forall ix. ix -> Sz ix
SafeSz (Sz Int -> Int
coerce (Vector r e -> Sz Int
forall r ix e. Load r ix e => Array r ix e -> Sz ix
size Vector r e
v) Int -> Int -> Int
forall a. Num a => a -> a -> a
- Int
1)) Vector r e
v
{-# INLINE unsafeInit #-}
unsafeTail :: Source r Ix1 e => Vector r e -> Vector r e
unsafeTail :: Vector r e -> Vector r e
unsafeTail = Sz Int -> Vector r e -> Vector r e
forall r e. Source r Int e => Sz Int -> Vector r e -> Vector r e
unsafeDrop Sz Int
1
{-# INLINE unsafeTail #-}
unsafeTake :: Source r Ix1 e => Sz1 -> Vector r e -> Vector r e
unsafeTake :: Sz Int -> Vector r e -> Vector r e
unsafeTake = Int -> Sz Int -> Vector r e -> Vector r e
forall r ix e.
Source r ix e =>
Int -> Sz Int -> Array r ix e -> Array r Int e
unsafeLinearSlice Int
0
{-# INLINE unsafeTake #-}
unsafeDrop :: Source r Ix1 e => Sz1 -> Vector r e -> Vector r e
unsafeDrop :: Sz Int -> Vector r e -> Vector r e
unsafeDrop (Sz Int
d) Vector r e
v = Int -> Sz Int -> Vector r e -> Vector r e
forall r ix e.
Source r ix e =>
Int -> Sz Int -> Array r ix e -> Array r Int e
unsafeLinearSlice Int
d (Int -> Sz Int
forall ix. ix -> Sz ix
SafeSz (Sz Int -> Int
coerce (Vector r e -> Sz Int
forall r ix e. Load r ix e => Array r ix e -> Sz ix
size Vector r e
v) Int -> Int -> Int
forall a. Num a => a -> a -> a
- Int
d)) Vector r e
v
{-# INLINE unsafeDrop #-}
unsafeFromListN :: Sz1 -> [e] -> Vector DS e
unsafeFromListN :: Sz Int -> [e] -> Vector DS e
unsafeFromListN (Sz Int
n) = Steps Id e -> Vector DS e
forall e. Steps Id e -> Array DS Int e
fromSteps (Steps Id e -> Vector DS e)
-> ([e] -> Steps Id e) -> [e] -> Vector DS e
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Int -> [e] -> Steps Id e
forall (m :: * -> *) e. Monad m => Int -> [e] -> Steps m e
S.unsafeFromListN Int
n
{-# INLINE unsafeFromListN #-}
unsafeUnfoldrN ::
Sz1
-> (s -> Maybe (e, s))
-> s
-> Vector DS e
unsafeUnfoldrN :: Sz Int -> (s -> Maybe (e, s)) -> s -> Vector DS e
unsafeUnfoldrN (Sz Int
n) s -> Maybe (e, s)
f = Steps Id e -> Vector DS e
forall e. Steps Id e -> Array DS Int e
DSArray (Steps Id e -> Vector DS e)
-> (s -> Steps Id e) -> s -> Vector DS e
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Int -> (s -> Maybe (e, s)) -> s -> Steps Id e
forall (m :: * -> *) s e.
Monad m =>
Int -> (s -> Maybe (e, s)) -> s -> Steps m e
S.unsafeUnfoldrN Int
n s -> Maybe (e, s)
f
{-# INLINE unsafeUnfoldrN #-}
unsafeUnfoldrNM :: Monad m => Sz1 -> (s -> m (Maybe (e, s))) -> s -> m (Vector DS e)
unsafeUnfoldrNM :: Sz Int -> (s -> m (Maybe (e, s))) -> s -> m (Vector DS e)
unsafeUnfoldrNM (Sz Int
n) s -> m (Maybe (e, s))
f = Steps m e -> m (Vector DS e)
forall (m :: * -> *) e. Monad m => Steps m e -> m (Array DS Int e)
fromStepsM (Steps m e -> m (Vector DS e))
-> (s -> Steps m e) -> s -> m (Vector DS e)
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Int -> (s -> m (Maybe (e, s))) -> s -> Steps m e
forall (m :: * -> *) s e.
Monad m =>
Int -> (s -> m (Maybe (e, s))) -> s -> Steps m e
S.unsafeUnfoldrNM Int
n s -> m (Maybe (e, s))
f
{-# INLINE unsafeUnfoldrNM #-}