module Data.Vector (
Vector,
length, null,
empty, singleton, cons, snoc, replicate, (++), copy,
(!), head, last, indexM, headM, lastM,
slice, init, tail, take, drop,
accum, (//), update, backpermute, reverse,
map, concatMap,
zipWith, zipWith3, zip, zip3, unzip, unzip3,
filter, takeWhile, dropWhile,
elem, notElem, find, findIndex,
foldl, foldl1, foldl', foldl1', foldr, foldr1,
and, or, sum, product, maximum, minimum,
unfoldr,
prescanl, prescanl',
enumFromTo, enumFromThenTo,
toList, fromList
) where
import Data.Vector.IVector ( IVector(..) )
import qualified Data.Vector.IVector as IV
import qualified Data.Vector.Mutable.ST as Mut
import Control.Monad.ST ( runST )
import GHC.ST ( ST(..) )
import GHC.Prim ( Array#, unsafeFreezeArray#, indexArray#, (+#) )
import GHC.Base ( Int(..) )
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,
and, or, sum, product, minimum, maximum,
enumFromTo, enumFromThenTo )
import qualified Prelude
data Vector a = Vector !Int
!Int
(Array# a)
instance Show a => Show (Vector a) where
show = (Prelude.++ " :: Data.Vector.Vector") . ("fromList " Prelude.++) . show . toList
instance IVector Vector a where
vnew init = runST (do
Mut.Vector i n marr# <- init
ST (\s# -> case unsafeFreezeArray# marr# s# of
(# s2#, arr# #) -> (# s2#, Vector i n arr# #)))
vlength (Vector _ n _) = n
unsafeSlice (Vector i _ arr#) j n = Vector (i+j) n arr#
unsafeIndexM (Vector (I# i#) _ arr#) (I# j#)
= case indexArray# arr# (i# +# j#) of (# x #) -> return x
instance Eq a => Eq (Vector a) where
(==) = IV.eq
instance Ord a => Ord (Vector a) where
compare = IV.cmp
length :: Vector a -> Int
length = IV.length
null :: Vector a -> Bool
null = IV.null
empty :: Vector a
empty = IV.empty
singleton :: a -> Vector a
singleton = IV.singleton
replicate :: Int -> a -> Vector a
replicate = IV.replicate
cons :: a -> Vector a -> Vector a
cons = IV.cons
snoc :: Vector a -> a -> Vector a
snoc = IV.snoc
infixr 5 ++
(++) :: Vector a -> Vector a -> Vector a
(++) = (IV.++)
copy :: Vector a -> Vector a
copy = IV.copy
(!) :: Vector a -> Int -> a
(!) = (IV.!)
head :: Vector a -> a
head = IV.head
last :: Vector a -> a
last = IV.last
indexM :: Monad m => Vector a -> Int -> m a
indexM = IV.indexM
headM :: Monad m => Vector a -> m a
headM = IV.headM
lastM :: Monad m => Vector a -> m a
lastM = IV.lastM
slice :: Vector a -> Int
-> Int
-> Vector a
slice = IV.slice
init :: Vector a -> Vector a
init = IV.init
tail :: Vector a -> Vector a
tail = IV.tail
take :: Int -> Vector a -> Vector a
take = IV.take
drop :: Int -> Vector a -> Vector a
drop = IV.drop
accum :: (a -> b -> a) -> Vector a -> [(Int,b)] -> Vector a
accum = IV.accum
(//) :: Vector a -> [(Int, a)] -> Vector a
(//) = (IV.//)
update :: Vector a -> Vector (Int, a) -> Vector a
update = IV.update
backpermute :: Vector a -> Vector Int -> Vector a
backpermute = IV.backpermute
reverse :: Vector a -> Vector a
reverse = IV.reverse
map :: (a -> b) -> Vector a -> Vector b
map = IV.map
concatMap :: (a -> Vector b) -> Vector a -> Vector b
concatMap = IV.concatMap
zipWith :: (a -> b -> c) -> Vector a -> Vector b -> Vector c
zipWith = IV.zipWith
zipWith3 :: (a -> b -> c -> d) -> Vector a -> Vector b -> Vector c -> Vector d
zipWith3 = IV.zipWith3
zip :: Vector a -> Vector b -> Vector (a, b)
zip = IV.zip
zip3 :: Vector a -> Vector b -> Vector c -> Vector (a, b, c)
zip3 = IV.zip3
unzip :: Vector (a, b) -> (Vector a, Vector b)
unzip = IV.unzip
unzip3 :: Vector (a, b, c) -> (Vector a, Vector b, Vector c)
unzip3 = IV.unzip3
filter :: (a -> Bool) -> Vector a -> Vector a
filter = IV.filter
takeWhile :: (a -> Bool) -> Vector a -> Vector a
takeWhile = IV.takeWhile
dropWhile :: (a -> Bool) -> Vector a -> Vector a
dropWhile = IV.dropWhile
infix 4 `elem`
elem :: Eq a => a -> Vector a -> Bool
elem = IV.elem
infix 4 `notElem`
notElem :: Eq a => a -> Vector a -> Bool
notElem = IV.notElem
find :: (a -> Bool) -> Vector a -> Maybe a
find = IV.find
findIndex :: (a -> Bool) -> Vector a -> Maybe Int
findIndex = IV.findIndex
foldl :: (a -> b -> a) -> a -> Vector b -> a
foldl = IV.foldl
foldl1 :: (a -> a -> a) -> Vector a -> a
foldl1 = IV.foldl1
foldl' :: (a -> b -> a) -> a -> Vector b -> a
foldl' = IV.foldl'
foldl1' :: (a -> a -> a) -> Vector a -> a
foldl1' = IV.foldl1'
foldr :: (a -> b -> b) -> b -> Vector a -> b
foldr = IV.foldr
foldr1 :: (a -> a -> a) -> Vector a -> a
foldr1 = IV.foldr1
and :: Vector Bool -> Bool
and = IV.and
or :: Vector Bool -> Bool
or = IV.or
sum :: Num a => Vector a -> a
sum = IV.sum
product :: Num a => Vector a -> a
product = IV.product
maximum :: Ord a => Vector a -> a
maximum = IV.maximum
minimum :: Ord a => Vector a -> a
minimum = IV.minimum
unfoldr :: (b -> Maybe (a, b)) -> b -> Vector a
unfoldr = IV.unfoldr
prescanl :: (a -> b -> a) -> a -> Vector b -> Vector a
prescanl = IV.prescanl
prescanl' :: (a -> b -> a) -> a -> Vector b -> Vector a
prescanl' = IV.prescanl'
enumFromTo :: Enum a => a -> a -> Vector a
enumFromTo = IV.enumFromTo
enumFromThenTo :: Enum a => a -> a -> a -> Vector a
enumFromThenTo = IV.enumFromThenTo
toList :: Vector a -> [a]
toList = IV.toList
fromList :: [a] -> Vector a
fromList = IV.fromList