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

Safe HaskellNone

Sparse.Matrix.Internal.Array

Contents

Synopsis

Documentation

type Array a = Arr a aSource

Internals

data V_Complex whereSource

Constructors

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

Instances

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

data MV_Complex whereSource

Constructors

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

Instances

data V_Pair whereSource

Constructors

V_Pair :: !Int -> !(Array a) -> !(Array b) -> V_Pair (a, b) 

Instances

(Arrayed a, Arrayed b) => Vector V_Pair (a, b) 
(Arrayed a, Arrayed b, Eq a, Eq b, ~ * c (a, b)) => Eq (V_Pair c) 
(Arrayed a, Arrayed b, Read a, Read b, ~ * c (a, b)) => Read (V_Pair c) 
(Arrayed a, Arrayed b, Show a, Show b, ~ * c (a, b)) => Show (V_Pair c) 
(Arrayed a, Arrayed b, ~ * c (a, b)) => Monoid (V_Pair c) 

data MV_Pair whereSource

Constructors

MV_Pair :: !Int -> !(Mutable (Arr a) s a) -> !(Mutable (Arr b) s b) -> MV_Pair s (a, b) 

Instances

(Arrayed a, Arrayed b) => MVector MV_Pair (a, b)