Modulevector-0.13.2.0

Data.Vector.Primitive

2 types
1 class
193 values

Packagevector-0.13.2.0
Exports196
LicenceBSD-3-Clause
SourceTypes.hs

valueconvert :: (Vector v a, Vector w a) => v a -> w a

value(!) :: Prim a => Vector a -> Int -> a

value(!?) :: Prim a => Vector a -> Int -> Maybe a

value(++) :: Prim a => Vector a -> Vector a -> Vector a

value(//) :: Prim a => Vector a -> [(Int, a)] -> Vector a

valueaccum :: Prim a => (a -> b -> a) -> Vector a -> [(Int, b)] -> Vector a

valueaccumulate_

:: (Prim a, Prim b)
=> a -> b -> a
-> Vector a
-> Vector Int
-> Vector b
-> Vector a

valueall :: Prim a => (a -> Bool) -> Vector a -> Bool

valueany :: Prim a => (a -> Bool) -> Vector a -> Bool

valuebackpermute :: Prim a => Vector a -> Vector Int -> Vector a

valuebreak :: Prim a => (a -> Bool) -> Vector a -> (Vector a, Vector a)

valuebreakR :: Prim a => (a -> Bool) -> Vector a -> (Vector a, Vector a)

valuecmpBy

:: (Prim a, Prim b)
=> a -> b -> Ordering
-> Vector a
-> Vector b
-> Ordering

valueconcat :: Prim a => [Vector a] -> Vector a

valueconcatMap :: (Prim a, Prim b) => (a -> Vector b) -> Vector a -> Vector b

valuecons :: Prim a => a -> Vector a -> Vector a

valueconstructN :: Prim a => Int -> (Vector a -> a) -> Vector a

valueconstructrN :: Prim a => Int -> (Vector a -> a) -> Vector a

valuecopy :: (Prim a, PrimMonad m) => MVector (PrimState m) a -> Vector a -> m ()

valuecreate :: Prim a => (forall s. ST s (MVector s a)) -> Vector a

valuecreateT

:: (Traversable f, Prim a)
=> forall s. ST s (f (MVector s a))
-> f (Vector a)

valuedrop :: Prim a => Int -> Vector a -> Vector a

valuedropWhile :: Prim a => (a -> Bool) -> Vector a -> Vector a

valueelem :: (Prim a, Eq a) => a -> Vector a -> Bool

valueelemIndex :: (Prim a, Eq a) => a -> Vector a -> Maybe Int

valueelemIndices :: (Prim a, Eq a) => a -> Vector a -> Vector Int

valueempty :: Prim a => Vector a

valueenumFromN :: (Prim a, Num a) => a -> Int -> Vector a

valueenumFromStepN :: (Prim a, Num a) => a -> a -> Int -> Vector a

valueenumFromThenTo :: (Prim a, Enum a) => a -> a -> a -> Vector a

valueenumFromTo :: (Prim a, Enum a) => a -> a -> Vector a

valueeqBy :: (Prim a, Prim b) => (a -> b -> Bool) -> Vector a -> Vector b -> Bool

valuefilter :: Prim a => (a -> Bool) -> Vector a -> Vector a

valuefilterM :: (Monad m, Prim a) => (a -> m Bool) -> Vector a -> m (Vector a)

valuefind :: Prim a => (a -> Bool) -> Vector a -> Maybe a

valuefindIndex :: Prim a => (a -> Bool) -> Vector a -> Maybe Int

valuefindIndexR :: Prim a => (a -> Bool) -> Vector a -> Maybe Int

valuefindIndices :: Prim a => (a -> Bool) -> Vector a -> Vector Int

valuefold1M :: (Monad m, Prim a) => (a -> a -> m a) -> Vector a -> m a

valuefold1M' :: (Monad m, Prim a) => (a -> a -> m a) -> Vector a -> m a

valuefold1M'_ :: (Monad m, Prim a) => (a -> a -> m a) -> Vector a -> m ()

valuefold1M_ :: (Monad m, Prim a) => (a -> a -> m a) -> Vector a -> m ()

valuefoldM :: (Monad m, Prim b) => (a -> b -> m a) -> a -> Vector b -> m a

valuefoldM' :: (Monad m, Prim b) => (a -> b -> m a) -> a -> Vector b -> m a

valuefoldM'_ :: (Monad m, Prim b) => (a -> b -> m a) -> a -> Vector b -> m ()

valuefoldM_ :: (Monad m, Prim b) => (a -> b -> m a) -> a -> Vector b -> m ()

valuefoldMap :: (Monoid m, Prim a) => (a -> m) -> Vector a -> m

valuefoldMap' :: (Monoid m, Prim a) => (a -> m) -> Vector a -> m

valuefoldl :: Prim b => (a -> b -> a) -> a -> Vector b -> a

valuefoldl' :: Prim b => (a -> b -> a) -> a -> Vector b -> a

valuefoldl1 :: Prim a => (a -> a -> a) -> Vector a -> a

valuefoldl1' :: Prim a => (a -> a -> a) -> Vector a -> a

valuefoldr :: Prim a => (a -> b -> b) -> b -> Vector a -> b

valuefoldr' :: Prim a => (a -> b -> b) -> b -> Vector a -> b

valuefoldr1 :: Prim a => (a -> a -> a) -> Vector a -> a

valuefoldr1' :: Prim a => (a -> a -> a) -> Vector a -> a

valueforM :: (Monad m, Prim a, Prim b) => Vector a -> (a -> m b) -> m (Vector b)

valueforM_ :: (Monad m, Prim a) => Vector a -> (a -> m b) -> m ()

valueforce :: Prim a => Vector a -> Vector a

valuefreeze :: (Prim a, PrimMonad m) => MVector (PrimState m) a -> m (Vector a)

valuefromList :: Prim a => [a] -> Vector a

valuefromListN :: Prim a => Int -> [a] -> Vector a

valuegenerate :: Prim a => Int -> (Int -> a) -> Vector a

valuegenerateM :: (Monad m, Prim a) => Int -> (Int -> m a) -> m (Vector a)

valuegroup :: (Prim a, Eq a) => Vector a -> [Vector a]

valuegroupBy :: Prim a => (a -> a -> Bool) -> Vector a -> [Vector a]

valuehead :: Prim a => Vector a -> a

valueheadM :: (Prim a, Monad m) => Vector a -> m a

valueifilter :: Prim a => (Int -> a -> Bool) -> Vector a -> Vector a

valueifoldM

:: (Monad m, Prim b)
=> a -> Int -> b -> m a
-> a
-> Vector b
-> m a

valueifoldM'

:: (Monad m, Prim b)
=> a -> Int -> b -> m a
-> a
-> Vector b
-> m a

valueifoldM'_

:: (Monad m, Prim b)
=> a -> Int -> b -> m a
-> a
-> Vector b
-> m ()

valueifoldM_

:: (Monad m, Prim b)
=> a -> Int -> b -> m a
-> a
-> Vector b
-> m ()

valueifoldl :: Prim b => (a -> Int -> b -> a) -> a -> Vector b -> a

valueifoldl' :: Prim b => (a -> Int -> b -> a) -> a -> Vector b -> a

valueifoldr :: Prim a => (Int -> a -> b -> b) -> b -> Vector a -> b

valueifoldr' :: Prim a => (Int -> a -> b -> b) -> b -> Vector a -> b

valueiforM

:: (Monad m, Prim a, Prim b)
=> Vector a
-> Int -> a -> m b
-> m (Vector b)

valueiforM_ :: (Monad m, Prim a) => Vector a -> (Int -> a -> m b) -> m ()

valueimap :: (Prim a, Prim b) => (Int -> a -> b) -> Vector a -> Vector b

valueimapM

:: (Monad m, Prim a, Prim b)
=> Int -> a -> m b
-> Vector a
-> m (Vector b)

valueimapM_ :: (Monad m, Prim a) => (Int -> a -> m b) -> Vector a -> m ()

valueimapMaybe

:: (Prim a, Prim b)
=> Int -> a -> Maybe b
-> Vector a
-> Vector b

valueimapMaybeM

:: (Monad m, Prim a, Prim b)
=> Int -> a -> m (Maybe b)
-> Vector a
-> m (Vector b)

valueindexM :: (Prim a, Monad m) => Vector a -> Int -> m a

valueinit :: Prim a => Vector a -> Vector a

valueiscanl

:: (Prim a, Prim b)
=> Int -> a -> b -> a
-> a
-> Vector b
-> Vector a

valueiscanl'

:: (Prim a, Prim b)
=> Int -> a -> b -> a
-> a
-> Vector b
-> Vector a

valueiscanr

:: (Prim a, Prim b)
=> Int -> a -> b -> b
-> b
-> Vector a
-> Vector b

valueiscanr'

:: (Prim a, Prim b)
=> Int -> a -> b -> b
-> b
-> Vector a
-> Vector b

valueiterateN :: Prim a => Int -> (a -> a) -> a -> Vector a

valueiterateNM :: (Monad m, Prim a) => Int -> (a -> m a) -> a -> m (Vector a)

valueizipWith

:: (Prim a, Prim b, Prim c)
=> Int -> a -> b -> c
-> Vector a
-> Vector b
-> Vector c

valueizipWith3

:: (Prim a, Prim b, Prim c, Prim d)
=> Int -> a -> b -> c -> d
-> Vector a
-> Vector b
-> Vector c
-> Vector d

valueizipWith4

:: (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

valueizipWith5

:: (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

valueizipWith6

:: (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

valueizipWithM

:: (Monad m, Prim a, Prim b, Prim c)
=> Int -> a -> b -> m c
-> Vector a
-> Vector b
-> m (Vector c)

valueizipWithM_

:: (Monad m, Prim a, Prim b)
=> Int -> a -> b -> m c
-> Vector a
-> Vector b
-> m ()

valuelast :: Prim a => Vector a -> a

valuelastM :: (Prim a, Monad m) => Vector a -> m a

valuelength :: Prim a => Vector a -> Int

valuemap :: (Prim a, Prim b) => (a -> b) -> Vector a -> Vector b

valuemapM :: (Monad m, Prim a, Prim b) => (a -> m b) -> Vector a -> m (Vector b)

valuemapM_ :: (Monad m, Prim a) => (a -> m b) -> Vector a -> m ()

valuemapMaybe :: (Prim a, Prim b) => (a -> Maybe b) -> Vector a -> Vector b

valuemapMaybeM

:: (Monad m, Prim a, Prim b)
=> a -> m (Maybe b)
-> Vector a
-> m (Vector b)

valuemaxIndex :: (Prim a, Ord a) => Vector a -> Int

valuemaxIndexBy :: Prim a => (a -> a -> Ordering) -> Vector a -> Int

valuemaximum :: (Prim a, Ord a) => Vector a -> a

valuemaximumBy :: Prim a => (a -> a -> Ordering) -> Vector a -> a

valuemaximumOn :: (Ord b, Prim a) => (a -> b) -> Vector a -> a

valueminIndex :: (Prim a, Ord a) => Vector a -> Int

valueminIndexBy :: Prim a => (a -> a -> Ordering) -> Vector a -> Int

valueminimum :: (Prim a, Ord a) => Vector a -> a

valueminimumBy :: Prim a => (a -> a -> Ordering) -> Vector a -> a

valueminimumOn :: (Ord b, Prim a) => (a -> b) -> Vector a -> a

valuemodify

:: Prim a
=> forall s. MVector s a -> ST s ()
-> Vector a
-> Vector a

valuenotElem :: (Prim a, Eq a) => a -> Vector a -> Bool

valuenull :: Prim a => Vector a -> Bool

valuepartition :: Prim a => (a -> Bool) -> Vector a -> (Vector a, Vector a)

valuepartitionWith

:: (Prim a, Prim b, Prim c)
=> a -> Either b c
-> Vector a
-> (Vector b, Vector c)

valuepostscanl :: (Prim a, Prim b) => (a -> b -> a) -> a -> Vector b -> Vector a

valuepostscanl' :: (Prim a, Prim b) => (a -> b -> a) -> a -> Vector b -> Vector a

valuepostscanr :: (Prim a, Prim b) => (a -> b -> b) -> b -> Vector a -> Vector b

valuepostscanr' :: (Prim a, Prim b) => (a -> b -> b) -> b -> Vector a -> Vector b

valueprescanl :: (Prim a, Prim b) => (a -> b -> a) -> a -> Vector b -> Vector a

valueprescanl' :: (Prim a, Prim b) => (a -> b -> a) -> a -> Vector b -> Vector a

valueprescanr :: (Prim a, Prim b) => (a -> b -> b) -> b -> Vector a -> Vector b

valueprescanr' :: (Prim a, Prim b) => (a -> b -> b) -> b -> Vector a -> Vector b

valueproduct :: (Prim a, Num a) => Vector a -> a

valuereplicate :: Prim a => Int -> a -> Vector a

valuereplicateM :: (Monad m, Prim a) => Int -> m a -> m (Vector a)

valuereverse :: Prim a => Vector a -> Vector a

valuescanl :: (Prim a, Prim b) => (a -> b -> a) -> a -> Vector b -> Vector a

valuescanl' :: (Prim a, Prim b) => (a -> b -> a) -> a -> Vector b -> Vector a

valuescanl1 :: Prim a => (a -> a -> a) -> Vector a -> Vector a

valuescanl1' :: Prim a => (a -> a -> a) -> Vector a -> Vector a

valuescanr :: (Prim a, Prim b) => (a -> b -> b) -> b -> Vector a -> Vector b

valuescanr' :: (Prim a, Prim b) => (a -> b -> b) -> b -> Vector a -> Vector b

valuescanr1 :: Prim a => (a -> a -> a) -> Vector a -> Vector a

valuescanr1' :: Prim a => (a -> a -> a) -> Vector a -> Vector a

valuesingleton :: Prim a => a -> Vector a

valueslice :: Prim a => Int -> Int -> Vector a -> Vector a

valuesnoc :: Prim a => Vector a -> a -> Vector a

valuespan :: Prim a => (a -> Bool) -> Vector a -> (Vector a, Vector a)

valuespanR :: Prim a => (a -> Bool) -> Vector a -> (Vector a, Vector a)

valuesplitAt :: Prim a => Int -> Vector a -> (Vector a, Vector a)

valuesum :: (Prim a, Num a) => Vector a -> a

valuetail :: Prim a => Vector a -> Vector a

valuetake :: Prim a => Int -> Vector a -> Vector a

valuetakeWhile :: Prim a => (a -> Bool) -> Vector a -> Vector a

valuethaw :: (Prim a, PrimMonad m) => Vector a -> m (MVector (PrimState m) a)

valuetoList :: Prim a => Vector a -> [a]

valueuncons :: Prim a => Vector a -> Maybe (a, Vector a)

valueunfoldr :: Prim a => (b -> Maybe (a, b)) -> b -> Vector a

valueunfoldrExactN :: Prim a => Int -> (b -> (a, b)) -> b -> Vector a

valueunfoldrExactNM

:: (Monad m, Prim a)
=> Int
-> b -> m (a, b)
-> b
-> m (Vector a)

valueunfoldrM

:: (Monad m, Prim a)
=> b -> m (Maybe (a, b))
-> b
-> m (Vector a)

valueunfoldrN :: Prim a => Int -> (b -> Maybe (a, b)) -> b -> Vector a

valueunfoldrNM

:: (Monad m, Prim a)
=> Int
-> b -> m (Maybe (a, b))
-> b
-> m (Vector a)

valueuniq :: (Prim a, Eq a) => Vector a -> Vector a

valueunsafeAccum :: Prim a => (a -> b -> a) -> Vector a -> [(Int, b)] -> Vector a

valueunsafeAccumulate_

:: (Prim a, Prim b)
=> a -> b -> a
-> Vector a
-> Vector Int
-> Vector b
-> Vector a

valueunsafeBackpermute :: Prim a => Vector a -> Vector Int -> Vector a

valueunsafeCast :: (HasCallStack, Prim a, Prim b) => Vector a -> Vector b

valueunsafeCoerceVector :: Coercible a b => Vector a -> Vector b

valueunsafeCopy

:: (Prim a, PrimMonad m)
=> MVector (PrimState m) a
-> Vector a
-> m ()

valueunsafeDrop :: Prim a => Int -> Vector a -> Vector a

valueunsafeFreeze

:: (Prim a, PrimMonad m)
=> MVector (PrimState m) a
-> m (Vector a)

valueunsafeHead :: Prim a => Vector a -> a

valueunsafeHeadM :: (Prim a, Monad m) => Vector a -> m a

valueunsafeIndex :: Prim a => Vector a -> Int -> a

valueunsafeIndexM :: (Prim a, Monad m) => Vector a -> Int -> m a

valueunsafeInit :: Prim a => Vector a -> Vector a

valueunsafeLast :: Prim a => Vector a -> a

valueunsafeLastM :: (Prim a, Monad m) => Vector a -> m a

valueunsafeSlice :: Prim a => Int -> Int -> Vector a -> Vector a

valueunsafeTail :: Prim a => Vector a -> Vector a

valueunsafeTake :: Prim a => Int -> Vector a -> Vector a

valueunsafeThaw

:: (Prim a, PrimMonad m)
=> Vector a
-> m (MVector (PrimState m) a)

valueunsafeUpd :: Prim a => Vector a -> [(Int, a)] -> Vector a

valueunsafeUpdate_ :: Prim a => Vector a -> Vector Int -> Vector a -> Vector a

valueunsnoc :: Prim a => Vector a -> Maybe (Vector a, a)

valueunstablePartition

:: Prim a
=> a -> Bool
-> Vector a
-> (Vector a, Vector a)

valueupdate_ :: Prim a => Vector a -> Vector Int -> Vector a -> Vector a

valuezipWith

:: (Prim a, Prim b, Prim c)
=> a -> b -> c
-> Vector a
-> Vector b
-> Vector c

valuezipWith3

:: (Prim a, Prim b, Prim c, Prim d)
=> a -> b -> c -> d
-> Vector a
-> Vector b
-> Vector c
-> Vector d

valuezipWith4

:: (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

valuezipWith5

:: (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

valuezipWith6

:: (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

valuezipWithM

:: (Monad m, Prim a, Prim b, Prim c)
=> a -> b -> m c
-> Vector a
-> Vector b
-> m (Vector c)

valuezipWithM_

:: (Monad m, Prim a, Prim b)
=> a -> b -> m c
-> Vector a
-> Vector b
-> m ()

classclass Prim a where

Class of types supporting primitive array operations. This includes interfacing with GC-managed memory (functions suffixed with ByteArray#) and interfacing with unmanaged memory (functions suffixed with Addr#). Endianness is platform-dependent.

Instances77Prim, …

Prim CBoolDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CCharDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CClockDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CDoubleDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CFloatDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CIntDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CIntMaxDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CIntPtrDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CLLongDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CLongDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CPtrdiffDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CSCharDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CSUSecondsDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CShortDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CSigAtomicDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CSizeDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CTimeDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CUCharDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CUIntDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CUIntMaxDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CUIntPtrDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CULLongDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CULongDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CUSecondsDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CUShortDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CWcharDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim IntPtrDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim WordPtrDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim Int16Defined in primitive-0.9.1.0 · Data.Primitive.Types
Prim Int32Defined in primitive-0.9.1.0 · Data.Primitive.Types
Prim Int64Defined in primitive-0.9.1.0 · Data.Primitive.Types
Prim Int8Defined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CBlkCntDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CBlkSizeDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CCcDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CClockIdDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CDevDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CFsBlkCntDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CFsFilCntDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CGidDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CIdDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CInoDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CKeyDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CModeDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CNlinkDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim COffDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CPidDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CRLimDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CSpeedDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CSsizeDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CTcflagDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CTimerDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CUidDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim FdDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim Word16Defined in primitive-0.9.1.0 · Data.Primitive.Types
Prim Word32Defined in primitive-0.9.1.0 · Data.Primitive.Types
Prim Word64Defined in primitive-0.9.1.0 · Data.Primitive.Types
Prim Word8Defined in primitive-0.9.1.0 · Data.Primitive.Types
Prim CharDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim DoubleDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim FloatDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim IntDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim WordDefined in primitive-0.9.1.0 · Data.Primitive.Types
Prim (FunPtr a)Defined in primitive-0.9.1.0 · Data.Primitive.Types
Prim (Ptr a)Defined in primitive-0.9.1.0 · Data.Primitive.Types
Prim (StablePtr a)Defined in primitive-0.9.1.0 · Data.Primitive.Types
Prim a => Prim (Complex a)Defined in primitive-0.9.1.0 · Data.Primitive.Types
Prim a => Prim (First a)Defined in primitive-0.9.1.0 · Data.Primitive.Types
Prim a => Prim (Last a)Defined in primitive-0.9.1.0 · Data.Primitive.Types
Prim a => Prim (Max a)Defined in primitive-0.9.1.0 · Data.Primitive.Types
Prim a => Prim (Min a)Defined in primitive-0.9.1.0 · Data.Primitive.Types
Prim a => Prim (Identity a)Defined in primitive-0.9.1.0 · Data.Primitive.Types
Prim a => Prim (Down a)Defined in primitive-0.9.1.0 · Data.Primitive.Types
Prim a => Prim (Dual a)Defined in primitive-0.9.1.0 · Data.Primitive.Types
Prim a => Prim (Product a)Defined in primitive-0.9.1.0 · Data.Primitive.Types
Prim a => Prim (Sum a)Defined in primitive-0.9.1.0 · Data.Primitive.Types
Prim a => Prim (Const a b)Defined in primitive-0.9.1.0 · Data.Primitive.Types

datadata Vector a

Constructors

Vector !Int !Int !ByteArray

Instances13NFData1, Vector, IsList, Eq, Data, Ord, …

NFData1 VectorDefined in vector-0.13.2.0 · Data.Vector.Primitive
Prim a => Vector Vector aDefined in vector-0.13.2.0 · Data.Vector.Primitive
Prim a => IsList (Vector a)Defined in vector-0.13.2.0 · Data.Vector.Primitive
(Prim a, Eq a) => Eq (Vector a)Defined in vector-0.13.2.0 · Data.Vector.Primitive
(Data a, Prim a) => Data (Vector a)Defined in vector-0.13.2.0 · Data.Vector.Primitive
(Prim a, Ord a) => Ord (Vector a)Defined in vector-0.13.2.0 · Data.Vector.Primitive
(Read a, Prim a) => Read (Vector a)Defined in vector-0.13.2.0 · Data.Vector.Primitive
(Show a, Prim a) => Show (Vector a)Defined in vector-0.13.2.0 · Data.Vector.Primitive
Prim a => Semigroup (Vector a)Defined in vector-0.13.2.0 · Data.Vector.Primitive
Prim a => Monoid (Vector a)Defined in vector-0.13.2.0 · Data.Vector.Primitive
NFData (Vector a)Defined in vector-0.13.2.0 · Data.Vector.Primitive
type Item (Vector a) = aDefined in vector-0.13.2.0 · Data.Vector.Primitive
type Mutable Vector = MVectorDefined in vector-0.13.2.0 · Data.Vector.Primitive

datadata MVector s a

Constructors

MVector !Int !Int !(MutableByteArray s)

Instances3MVector, NFData1, NFData

Prim a => MVector MVector aDefined in vector-0.13.2.0 · Data.Vector.Primitive.Mutable
NFData1 (MVector s)Defined in vector-0.13.2.0 · Data.Vector.Primitive.Mutable
NFData (MVector s a)Defined in vector-0.13.2.0 · Data.Vector.Primitive.Mutable