sparse-0.7.0.1: A playground of sparse linear algebra primitives using Morton ordering

Safe HaskellNone

Sparse.Matrix.Internal.Vectored

Contents

Synopsis

Documentation

type Vector a = Vec a aSource

Internals

data V_Complex whereSource

Constructors

V_Complex :: !Int -> !(Vector a) -> !(Vector a) -> V_Complex (Complex a) 

Instances

(Vectored a, RealFloat a) => Vector V_Complex (Complex a) 
(Vectored a, RealFloat a, Eq a, ~ * b (Complex a)) => Eq (V_Complex b) 
(Vectored a, RealFloat a, Read a, ~ * b (Complex a)) => Read (V_Complex b) 
(Vectored a, RealFloat a, Show a, ~ * b (Complex a)) => Show (V_Complex b) 
(Vectored a, RealFloat a, ~ * b (Complex a)) => Monoid (V_Complex b) 

data MV_Complex whereSource

Constructors

MV_Complex :: !Int -> !(Mutable (Vec a) s a) -> !(Mutable (Vec a) s a) -> MV_Complex s (Complex a) 

Instances