module Data.Vector.Primitive (
Vector, MVector(..), Prim,
length, null,
empty, singleton, cons, snoc, replicate, (++), copy,
(!), head, last,
slice, init, tail, take, drop,
accum, (//), backpermute, reverse,
map, concatMap,
zipWith, zipWith3,
filter, takeWhile, dropWhile,
elem, notElem, find, findIndex,
foldl, foldl1, foldl', foldl1', foldr, foldr1,
sum, product, maximum, minimum,
unfoldr,
prescanl, prescanl',
postscanl, postscanl',
scanl, scanl', scanl1, scanl1',
enumFromTo, enumFromThenTo,
toList, fromList
) where
import qualified Data.Vector.Generic as G
import Data.Vector.Primitive.Mutable ( MVector(..) )
import Data.Primitive.ByteArray
import Data.Primitive ( Prim )
import Control.Monad.ST ( runST )
import Prelude hiding ( length, null,
replicate, (++),
head, last,
init, tail, take, drop, reverse,
map, concatMap,
zipWith, zipWith3, zip, zip3, unzip, unzip3,
filter, takeWhile, dropWhile,
elem, notElem,
foldl, foldl1, foldr, foldr1,
sum, product, minimum, maximum,
scanl, scanl1,
enumFromTo, enumFromThenTo )
import qualified Prelude
data Vector a = Vector !Int
!Int
!ByteArray
instance (Show a, Prim a) => Show (Vector a) where
show = (Prelude.++ " :: Data.Vector.Primitive.Vector") . ("fromList " Prelude.++) . show . toList
instance Prim a => G.Vector Vector a where
vnew init = runST (do
MVector i n marr <- init
arr <- unsafeFreezeByteArray marr
return (Vector i n arr))
vlength (Vector _ n _) = n
unsafeSlice (Vector i _ arr) j n = Vector (i+j) n arr
unsafeIndexM (Vector i _ arr) j = return (indexByteArray arr (i+j))
instance (Prim a, Eq a) => Eq (Vector a) where
(==) = G.eq
instance (Prim a, Ord a) => Ord (Vector a) where
compare = G.cmp
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
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.++)
copy :: Prim a => Vector a -> Vector a
copy = G.copy
(!) :: 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
slice :: Prim a => Vector a -> Int
-> Int
-> 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
accum :: Prim a => (a -> b -> a) -> Vector a -> [(Int,b)] -> Vector a
accum = G.accum
(//) :: Prim a => Vector a -> [(Int, a)] -> Vector a
(//) = (G.//)
backpermute :: Prim a => Vector a -> Vector Int -> Vector a
backpermute = G.backpermute
reverse :: Prim a => Vector a -> Vector a
reverse = G.reverse
map :: (Prim a, Prim b) => (a -> b) -> Vector a -> Vector b
map = G.map
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
filter :: Prim a => (a -> Bool) -> Vector a -> Vector a
filter = G.filter
takeWhile :: Prim a => (a -> Bool) -> Vector a -> Vector a
takeWhile = G.takeWhile
dropWhile :: Prim a => (a -> Bool) -> Vector a -> Vector a
dropWhile = G.dropWhile
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
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
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
minimum :: (Prim a, Ord a) => Vector a -> a
minimum = G.minimum
unfoldr :: Prim a => (b -> Maybe (a, b)) -> b -> Vector a
unfoldr = G.unfoldr
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'
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