Safe Haskell | None |
---|---|
Language | Haskell2010 |
Vector which could hold any value.
Immutable
data Vec (n :: Nat) a Source #
Vector with fixed length which can hold any value.
Instances
Arity n => VectorN Vec n a Source # | |
Defined in Data.Vector.Fixed.Boxed | |
Arity n => Functor (Vec n) Source # | |
Arity n => Applicative (Vec n) Source # | |
Arity n => Foldable (Vec n) Source # | |
Defined in Data.Vector.Fixed.Boxed fold :: Monoid m => Vec n m -> m # foldMap :: Monoid m => (a -> m) -> Vec n a -> m # foldMap' :: Monoid m => (a -> m) -> Vec n a -> m # foldr :: (a -> b -> b) -> b -> Vec n a -> b # foldr' :: (a -> b -> b) -> b -> Vec n a -> b # foldl :: (b -> a -> b) -> b -> Vec n a -> b # foldl' :: (b -> a -> b) -> b -> Vec n a -> b # foldr1 :: (a -> a -> a) -> Vec n a -> a # foldl1 :: (a -> a -> a) -> Vec n a -> a # elem :: Eq a => a -> Vec n a -> Bool # maximum :: Ord a => Vec n a -> a # minimum :: Ord a => Vec n a -> a # | |
Arity n => Traversable (Vec n) Source # | |
Arity n => Vector (Vec n) a Source # | |
Arity n => IVector (Vec n) a Source # | |
(Arity n, Eq a) => Eq (Vec n a) Source # | |
(Typeable n, Arity n, Data a) => Data (Vec n a) Source # | |
Defined in Data.Vector.Fixed.Boxed 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 :: forall r r'. (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, Ord a) => Ord (Vec n a) Source # | |
(Arity n, Show a) => Show (Vec n a) Source # | |
(Arity n, Semigroup a) => Semigroup (Vec n a) Source # | |
(Arity n, Monoid a) => Monoid (Vec n a) Source # | |
(Storable a, Arity n) => Storable (Vec n a) Source # | |
(Arity n, NFData a) => NFData (Vec n a) Source # | |
Defined in Data.Vector.Fixed.Boxed | |
type Dim (Vec n) Source # | |
Defined in Data.Vector.Fixed.Boxed | |
type Mutable (Vec n) Source # | |
Defined in Data.Vector.Fixed.Boxed |
Mutable
data MVec (n :: Nat) s a Source #
Mutable unboxed vector with fixed length
Instances
Arity n => MVector (MVec n) a Source # | |
Defined in Data.Vector.Fixed.Boxed 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 # | |
Defined in Data.Vector.Fixed.Boxed |