module Data.Vector.Primitive (
Vector, MVector(..), Prim,
length, null,
empty, singleton, cons, snoc, replicate, generate, (++), force,
(!), head, last, indexM, headM, lastM,
unsafeIndex, unsafeHead, unsafeLast,
unsafeIndexM, unsafeHeadM, unsafeLastM,
slice, init, tail, take, drop,
unsafeSlice, unsafeInit, unsafeTail, unsafeTake, unsafeDrop,
accum, accumulate_, (//), update_, backpermute, reverse,
unsafeAccum, unsafeAccumulate_,
unsafeUpd, unsafeUpdate_,
unsafeBackpermute,
map, imap, concatMap,
zipWith, zipWith3, zipWith4, zipWith5, zipWith6,
izipWith, izipWith3, izipWith4, izipWith5, izipWith6,
filter, ifilter, takeWhile, dropWhile,
partition, unstablePartition, span, break,
elem, notElem, find, findIndex, findIndices, elemIndex, elemIndices,
foldl, foldl1, foldl', foldl1', foldr, foldr1, foldr', foldr1',
ifoldl, ifoldl', ifoldr, ifoldr',
all, any,
sum, product,
maximum, maximumBy, minimum, minimumBy,
minIndex, minIndexBy, maxIndex, maxIndexBy,
unfoldr, unfoldrN,
prescanl, prescanl',
postscanl, postscanl',
scanl, scanl', scanl1, scanl1',
prescanr, prescanr',
postscanr, postscanr',
scanr, scanr', scanr1, scanr1',
enumFromN, enumFromStepN, enumFromTo, enumFromThenTo,
toList, fromList, fromListN,
replicateM, mapM, mapM_, forM, forM_, zipWithM, zipWithM_, filterM,
foldM, foldM', fold1M, fold1M',
create, modify, copy, unsafeCopy
) where
import qualified Data.Vector.Generic as G
import Data.Vector.Primitive.Mutable ( MVector(..) )
import qualified Data.Vector.Fusion.Stream as Stream
import Data.Primitive.ByteArray
import Data.Primitive ( Prim, sizeOf )
import Control.Monad ( liftM )
import Control.Monad.ST ( ST )
import Control.Monad.Primitive
import Prelude hiding ( length, null,
replicate, (++),
head, last,
init, tail, take, drop, reverse,
map, concatMap,
zipWith, zipWith3, zip, zip3, unzip, unzip3,
filter, takeWhile, dropWhile, span, break,
elem, notElem,
foldl, foldl1, foldr, foldr1,
all, any, sum, product, minimum, maximum,
scanl, scanl1, scanr, scanr1,
enumFromTo, enumFromThenTo,
mapM, mapM_ )
import qualified Prelude
import Data.Typeable ( Typeable )
import Data.Data ( Data(..) )
data Vector a = Vector !Int
!Int
!ByteArray
deriving ( Typeable )
instance (Show a, Prim a) => Show (Vector a) where
show = (Prelude.++ " :: Data.Vector.Primitive.Vector") . ("fromList " Prelude.++) . show . toList
instance (Data a, Prim a) => Data (Vector a) where
gfoldl = G.gfoldl
toConstr _ = error "toConstr"
gunfold _ _ = error "gunfold"
dataTypeOf _ = G.mkType "Data.Vector.Primitive.Vector"
dataCast1 = G.dataCast
type instance G.Mutable Vector = MVector
instance Prim a => G.Vector Vector a where
unsafeFreeze (MVector i n marr)
= Vector i n `liftM` unsafeFreezeByteArray marr
basicLength (Vector _ n _) = n
basicUnsafeSlice j n (Vector i _ arr) = Vector (i+j) n arr
basicUnsafeIndexM (Vector i _ arr) j = return (indexByteArray arr (i+j))
basicUnsafeCopy (MVector i n dst) (Vector j _ src)
= memcpyByteArray' dst (i * sz) src (j * sz) (n * sz)
where
sz = sizeOf (undefined :: a)
elemseq _ = seq
instance (Prim a, Eq a) => Eq (Vector a) where
xs == ys = Stream.eq (G.stream xs) (G.stream ys)
xs /= ys = not (Stream.eq (G.stream xs) (G.stream ys))
instance (Prim a, Ord a) => Ord (Vector a) where
compare xs ys = Stream.cmp (G.stream xs) (G.stream ys)
xs < ys = Stream.cmp (G.stream xs) (G.stream ys) == LT
xs <= ys = Stream.cmp (G.stream xs) (G.stream ys) /= GT
xs > ys = Stream.cmp (G.stream xs) (G.stream ys) == GT
xs >= ys = Stream.cmp (G.stream xs) (G.stream ys) /= LT
length :: Prim a => Vector a -> Int
length = G.length
null :: Prim a => Vector a -> Bool
null = G.null
empty :: Prim a => Vector a
empty = G.empty
singleton :: Prim a => a -> Vector a
singleton = G.singleton
replicate :: Prim a => Int -> a -> Vector a
replicate = G.replicate
generate :: Prim a => Int -> (Int -> a) -> Vector a
generate = G.generate
cons :: Prim a => a -> Vector a -> Vector a
cons = G.cons
snoc :: Prim a => Vector a -> a -> Vector a
snoc = G.snoc
infixr 5 ++
(++) :: Prim a => Vector a -> Vector a -> Vector a
(++) = (G.++)
force :: Prim a => Vector a -> Vector a
force = G.force
(!) :: Prim a => Vector a -> Int -> a
(!) = (G.!)
head :: Prim a => Vector a -> a
head = G.head
last :: Prim a => Vector a -> a
last = G.last
unsafeIndex :: Prim a => Vector a -> Int -> a
unsafeIndex = G.unsafeIndex
unsafeHead :: Prim a => Vector a -> a
unsafeHead = G.unsafeHead
unsafeLast :: Prim a => Vector a -> a
unsafeLast = G.unsafeLast
indexM :: (Prim a, Monad m) => Vector a -> Int -> m a
indexM = G.indexM
headM :: (Prim a, Monad m) => Vector a -> m a
headM = G.headM
lastM :: (Prim a, Monad m) => Vector a -> m a
lastM = G.lastM
unsafeIndexM :: (Prim a, Monad m) => Vector a -> Int -> m a
unsafeIndexM = G.unsafeIndexM
unsafeHeadM :: (Prim a, Monad m) => Vector a -> m a
unsafeHeadM = G.unsafeHeadM
unsafeLastM :: (Prim a, Monad m) => Vector a -> m a
unsafeLastM = G.unsafeLastM
slice :: Prim a => Int
-> Int
-> Vector a
-> Vector a
slice = G.slice
init :: Prim a => Vector a -> Vector a
init = G.init
tail :: Prim a => Vector a -> Vector a
tail = G.tail
take :: Prim a => Int -> Vector a -> Vector a
take = G.take
drop :: Prim a => Int -> Vector a -> Vector a
drop = G.drop
unsafeSlice :: Prim a => Int
-> Int
-> Vector a
-> Vector a
unsafeSlice = G.unsafeSlice
unsafeInit :: Prim a => Vector a -> Vector a
unsafeInit = G.unsafeInit
unsafeTail :: Prim a => Vector a -> Vector a
unsafeTail = G.unsafeTail
unsafeTake :: Prim a => Int -> Vector a -> Vector a
unsafeTake = G.unsafeTake
unsafeDrop :: Prim a => Int -> Vector a -> Vector a
unsafeDrop = G.unsafeDrop
unsafeAccum :: Prim a => (a -> b -> a) -> Vector a -> [(Int,b)] -> Vector a
unsafeAccum = G.unsafeAccum
unsafeAccumulate_ :: (Prim a, Prim b) =>
(a -> b -> a) -> Vector a -> Vector Int -> Vector b -> Vector a
unsafeAccumulate_ = G.unsafeAccumulate_
accum :: Prim a => (a -> b -> a) -> Vector a -> [(Int,b)] -> Vector a
accum = G.accum
accumulate_ :: (Prim a, Prim b) =>
(a -> b -> a) -> Vector a -> Vector Int -> Vector b -> Vector a
accumulate_ = G.accumulate_
unsafeUpd :: Prim a => Vector a -> [(Int, a)] -> Vector a
unsafeUpd = G.unsafeUpd
unsafeUpdate_ :: Prim a => Vector a -> Vector Int -> Vector a -> Vector a
unsafeUpdate_ = G.unsafeUpdate_
(//) :: Prim a => Vector a -> [(Int, a)] -> Vector a
(//) = (G.//)
update_ :: Prim a => Vector a -> Vector Int -> Vector a -> Vector a
update_ = G.update_
backpermute :: Prim a => Vector a -> Vector Int -> Vector a
backpermute = G.backpermute
unsafeBackpermute :: Prim a => Vector a -> Vector Int -> Vector a
unsafeBackpermute = G.unsafeBackpermute
reverse :: Prim a => Vector a -> Vector a
reverse = G.reverse
map :: (Prim a, Prim b) => (a -> b) -> Vector a -> Vector b
map = G.map
imap :: (Prim a, Prim b) => (Int -> a -> b) -> Vector a -> Vector b
imap = G.imap
concatMap :: (Prim a, Prim b) => (a -> Vector b) -> Vector a -> Vector b
concatMap = G.concatMap
zipWith :: (Prim a, Prim b, Prim c)
=> (a -> b -> c) -> Vector a -> Vector b -> Vector c
zipWith = G.zipWith
zipWith3 :: (Prim a, Prim b, Prim c, Prim d)
=> (a -> b -> c -> d) -> Vector a -> Vector b -> Vector c -> Vector d
zipWith3 = G.zipWith3
zipWith4 :: (Prim a, Prim b, Prim c, Prim d, Prim e)
=> (a -> b -> c -> d -> e)
-> Vector a -> Vector b -> Vector c -> Vector d -> Vector e
zipWith4 = G.zipWith4
zipWith5 :: (Prim a, Prim b, Prim c, Prim d, Prim e, Prim f)
=> (a -> b -> c -> d -> e -> f)
-> Vector a -> Vector b -> Vector c -> Vector d -> Vector e
-> Vector f
zipWith5 = G.zipWith5
zipWith6 :: (Prim a, Prim b, Prim c, Prim d, Prim e, Prim f, Prim g)
=> (a -> b -> c -> d -> e -> f -> g)
-> Vector a -> Vector b -> Vector c -> Vector d -> Vector e
-> Vector f -> Vector g
zipWith6 = G.zipWith6
izipWith :: (Prim a, Prim b, Prim c)
=> (Int -> a -> b -> c) -> Vector a -> Vector b -> Vector c
izipWith = G.izipWith
izipWith3 :: (Prim a, Prim b, Prim c, Prim d)
=> (Int -> a -> b -> c -> d)
-> Vector a -> Vector b -> Vector c -> Vector d
izipWith3 = G.izipWith3
izipWith4 :: (Prim a, Prim b, Prim c, Prim d, Prim e)
=> (Int -> a -> b -> c -> d -> e)
-> Vector a -> Vector b -> Vector c -> Vector d -> Vector e
izipWith4 = G.izipWith4
izipWith5 :: (Prim a, Prim b, Prim c, Prim d, Prim e, Prim f)
=> (Int -> a -> b -> c -> d -> e -> f)
-> Vector a -> Vector b -> Vector c -> Vector d -> Vector e
-> Vector f
izipWith5 = G.izipWith5
izipWith6 :: (Prim a, Prim b, Prim c, Prim d, Prim e, Prim f, Prim g)
=> (Int -> a -> b -> c -> d -> e -> f -> g)
-> Vector a -> Vector b -> Vector c -> Vector d -> Vector e
-> Vector f -> Vector g
izipWith6 = G.izipWith6
filter :: Prim a => (a -> Bool) -> Vector a -> Vector a
filter = G.filter
ifilter :: Prim a => (Int -> a -> Bool) -> Vector a -> Vector a
ifilter = G.ifilter
takeWhile :: Prim a => (a -> Bool) -> Vector a -> Vector a
takeWhile = G.takeWhile
dropWhile :: Prim a => (a -> Bool) -> Vector a -> Vector a
dropWhile = G.dropWhile
partition :: Prim a => (a -> Bool) -> Vector a -> (Vector a, Vector a)
partition = G.partition
unstablePartition :: Prim a => (a -> Bool) -> Vector a -> (Vector a, Vector a)
unstablePartition = G.unstablePartition
span :: Prim a => (a -> Bool) -> Vector a -> (Vector a, Vector a)
span = G.span
break :: Prim a => (a -> Bool) -> Vector a -> (Vector a, Vector a)
break = G.break
infix 4 `elem`
elem :: (Prim a, Eq a) => a -> Vector a -> Bool
elem = G.elem
infix 4 `notElem`
notElem :: (Prim a, Eq a) => a -> Vector a -> Bool
notElem = G.notElem
find :: Prim a => (a -> Bool) -> Vector a -> Maybe a
find = G.find
findIndex :: Prim a => (a -> Bool) -> Vector a -> Maybe Int
findIndex = G.findIndex
findIndices :: Prim a => (a -> Bool) -> Vector a -> Vector Int
findIndices = G.findIndices
elemIndex :: (Prim a, Eq a) => a -> Vector a -> Maybe Int
elemIndex = G.elemIndex
elemIndices :: (Prim a, Eq a) => a -> Vector a -> Vector Int
elemIndices = G.elemIndices
foldl :: Prim b => (a -> b -> a) -> a -> Vector b -> a
foldl = G.foldl
foldl1 :: Prim a => (a -> a -> a) -> Vector a -> a
foldl1 = G.foldl1
foldl' :: Prim b => (a -> b -> a) -> a -> Vector b -> a
foldl' = G.foldl'
foldl1' :: Prim a => (a -> a -> a) -> Vector a -> a
foldl1' = G.foldl1'
foldr :: Prim a => (a -> b -> b) -> b -> Vector a -> b
foldr = G.foldr
foldr1 :: Prim a => (a -> a -> a) -> Vector a -> a
foldr1 = G.foldr1
foldr' :: Prim a => (a -> b -> b) -> b -> Vector a -> b
foldr' = G.foldr'
foldr1' :: Prim a => (a -> a -> a) -> Vector a -> a
foldr1' = G.foldr1'
ifoldl :: Prim b => (a -> Int -> b -> a) -> a -> Vector b -> a
ifoldl = G.ifoldl
ifoldl' :: Prim b => (a -> Int -> b -> a) -> a -> Vector b -> a
ifoldl' = G.ifoldl'
ifoldr :: Prim a => (Int -> a -> b -> b) -> b -> Vector a -> b
ifoldr = G.ifoldr
ifoldr' :: Prim a => (Int -> a -> b -> b) -> b -> Vector a -> b
ifoldr' = G.ifoldr'
all :: Prim a => (a -> Bool) -> Vector a -> Bool
all = G.all
any :: Prim a => (a -> Bool) -> Vector a -> Bool
any = G.any
sum :: (Prim a, Num a) => Vector a -> a
sum = G.sum
product :: (Prim a, Num a) => Vector a -> a
product = G.product
maximum :: (Prim a, Ord a) => Vector a -> a
maximum = G.maximum
maximumBy :: Prim a => (a -> a -> Ordering) -> Vector a -> a
maximumBy = G.maximumBy
minimum :: (Prim a, Ord a) => Vector a -> a
minimum = G.minimum
minimumBy :: Prim a => (a -> a -> Ordering) -> Vector a -> a
minimumBy = G.minimumBy
maxIndex :: (Prim a, Ord a) => Vector a -> Int
maxIndex = G.maxIndex
maxIndexBy :: Prim a => (a -> a -> Ordering) -> Vector a -> Int
maxIndexBy = G.maxIndexBy
minIndex :: (Prim a, Ord a) => Vector a -> Int
minIndex = G.minIndex
minIndexBy :: Prim a => (a -> a -> Ordering) -> Vector a -> Int
minIndexBy = G.minIndexBy
unfoldr :: Prim a => (b -> Maybe (a, b)) -> b -> Vector a
unfoldr = G.unfoldr
unfoldrN :: Prim a => Int -> (b -> Maybe (a, b)) -> b -> Vector a
unfoldrN = G.unfoldrN
prescanl :: (Prim a, Prim b) => (a -> b -> a) -> a -> Vector b -> Vector a
prescanl = G.prescanl
prescanl' :: (Prim a, Prim b) => (a -> b -> a) -> a -> Vector b -> Vector a
prescanl' = G.prescanl'
postscanl :: (Prim a, Prim b) => (a -> b -> a) -> a -> Vector b -> Vector a
postscanl = G.postscanl
postscanl' :: (Prim a, Prim b) => (a -> b -> a) -> a -> Vector b -> Vector a
postscanl' = G.postscanl'
scanl :: (Prim a, Prim b) => (a -> b -> a) -> a -> Vector b -> Vector a
scanl = G.scanl
scanl' :: (Prim a, Prim b) => (a -> b -> a) -> a -> Vector b -> Vector a
scanl' = G.scanl'
scanl1 :: Prim a => (a -> a -> a) -> Vector a -> Vector a
scanl1 = G.scanl1
scanl1' :: Prim a => (a -> a -> a) -> Vector a -> Vector a
scanl1' = G.scanl1'
prescanr :: (Prim a, Prim b) => (a -> b -> b) -> b -> Vector a -> Vector b
prescanr = G.prescanr
prescanr' :: (Prim a, Prim b) => (a -> b -> b) -> b -> Vector a -> Vector b
prescanr' = G.prescanr'
postscanr :: (Prim a, Prim b) => (a -> b -> b) -> b -> Vector a -> Vector b
postscanr = G.postscanr
postscanr' :: (Prim a, Prim b) => (a -> b -> b) -> b -> Vector a -> Vector b
postscanr' = G.postscanr'
scanr :: (Prim a, Prim b) => (a -> b -> b) -> b -> Vector a -> Vector b
scanr = G.scanr
scanr' :: (Prim a, Prim b) => (a -> b -> b) -> b -> Vector a -> Vector b
scanr' = G.scanr'
scanr1 :: Prim a => (a -> a -> a) -> Vector a -> Vector a
scanr1 = G.scanr1
scanr1' :: Prim a => (a -> a -> a) -> Vector a -> Vector a
scanr1' = G.scanr1'
enumFromN :: (Prim a, Num a) => a -> Int -> Vector a
enumFromN = G.enumFromN
enumFromStepN :: (Prim a, Num a) => a -> a -> Int -> Vector a
enumFromStepN = G.enumFromStepN
enumFromTo :: (Prim a, Enum a) => a -> a -> Vector a
enumFromTo = G.enumFromTo
enumFromThenTo :: (Prim a, Enum a) => a -> a -> a -> Vector a
enumFromThenTo = G.enumFromThenTo
toList :: Prim a => Vector a -> [a]
toList = G.toList
fromList :: Prim a => [a] -> Vector a
fromList = G.fromList
fromListN :: Prim a => Int -> [a] -> Vector a
fromListN = G.fromListN
replicateM :: (Monad m, Prim a) => Int -> m a -> m (Vector a)
replicateM = G.replicateM
mapM :: (Monad m, Prim a, Prim b) => (a -> m b) -> Vector a -> m (Vector b)
mapM = G.mapM
mapM_ :: (Monad m, Prim a) => (a -> m b) -> Vector a -> m ()
mapM_ = G.mapM_
forM :: (Monad m, Prim a, Prim b) => Vector a -> (a -> m b) -> m (Vector b)
forM = G.forM
forM_ :: (Monad m, Prim a) => Vector a -> (a -> m b) -> m ()
forM_ = G.forM_
zipWithM :: (Monad m, Prim a, Prim b, Prim c)
=> (a -> b -> m c) -> Vector a -> Vector b -> m (Vector c)
zipWithM = G.zipWithM
zipWithM_ :: (Monad m, Prim a, Prim b)
=> (a -> b -> m c) -> Vector a -> Vector b -> m ()
zipWithM_ = G.zipWithM_
filterM :: (Monad m, Prim a) => (a -> m Bool) -> Vector a -> m (Vector a)
filterM = G.filterM
foldM :: (Monad m, Prim b) => (a -> b -> m a) -> a -> Vector b -> m a
foldM = G.foldM
fold1M :: (Monad m, Prim a) => (a -> a -> m a) -> Vector a -> m a
fold1M = G.fold1M
foldM' :: (Monad m, Prim b) => (a -> b -> m a) -> a -> Vector b -> m a
foldM' = G.foldM'
fold1M' :: (Monad m, Prim a) => (a -> a -> m a) -> Vector a -> m a
fold1M' = G.fold1M'
create :: Prim a => (forall s. ST s (MVector s a)) -> Vector a
create = G.create
modify :: Prim a => (forall s. MVector s a -> ST s ()) -> Vector a -> Vector a
modify = G.modify
unsafeCopy
:: (Prim a, PrimMonad m) => MVector (PrimState m) a -> Vector a -> m ()
unsafeCopy = G.unsafeCopy
copy :: (Prim a, PrimMonad m) => MVector (PrimState m) a -> Vector a -> m ()
copy = G.copy