Safe Haskell | None |
---|---|
Language | Haskell98 |
Unboxed vectors with fixed length. Vectors from Data.Vector.Fixed.Unboxed provide more flexibility at no performeance cost.
Immutable
Unboxed vector with fixed length
(Arity n, Prim a) => VectorN Vec n a Source # | |
(Arity n, Prim a) => Vector (Vec n) a Source # | |
(Arity n, Prim a) => IVector (Vec n) a Source # | |
(Arity n, Prim a, Eq a) => Eq (Vec n a) Source # | |
(Typeable * n, Arity n, Prim a, Data a) => Data (Vec n a) Source # | |
gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Vec n a -> c (Vec n a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Vec n a) # toConstr :: Vec n a -> Constr # dataTypeOf :: Vec n a -> DataType # dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c (Vec n a)) # dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Vec n a)) # gmapT :: (forall b. Data b => b -> b) -> Vec n a -> Vec n a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Vec n a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Vec n a -> r # gmapQ :: (forall d. Data d => d -> u) -> Vec n a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Vec n a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Vec n a -> m (Vec n a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Vec n a -> m (Vec n a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Vec n a -> m (Vec n a) # | |
(Arity n, Prim a, Ord a) => Ord (Vec n a) Source # | |
(Arity n, Prim a, Show a) => Show (Vec n a) Source # | |
(Arity n, Prim a, Monoid a) => Monoid (Vec n a) Source # | |
(Storable a, Prim a, Arity n) => Storable (Vec n a) Source # | |
(Arity n, Prim a, NFData a) => NFData (Vec n a) Source # | |
type Dim (Vec n) Source # | |
type Mutable (Vec n) Source # | |
Mutable
Mutable unboxed vector with fixed length
(Arity n, Prim a) => MVector (MVec n) a Source # | |
overlaps :: MVec n s a -> MVec n s a -> Bool Source # copy :: PrimMonad m => MVec n (PrimState m) a -> MVec n (PrimState m) a -> m () Source # move :: PrimMonad m => MVec n (PrimState m) a -> MVec n (PrimState m) a -> m () Source # new :: PrimMonad m => m (MVec n (PrimState m) a) Source # unsafeRead :: PrimMonad m => MVec n (PrimState m) a -> Int -> m a Source # unsafeWrite :: PrimMonad m => MVec n (PrimState m) a -> Int -> a -> m () Source # | |
type DimM (MVec n) Source # | |
Type classes
Class of types supporting primitive array operations
sizeOf#, alignment#, indexByteArray#, readByteArray#, writeByteArray#, setByteArray#, indexOffAddr#, readOffAddr#, writeOffAddr#, setOffAddr#