sparse-linear-algebra-0.2.0.5: Numerical computation in native Haskell

Safe HaskellSafe
LanguageHaskell2010

Numeric.LinearAlgebra.Sparse.IntMap

Contents

Synopsis

Documentation

insertIM2 :: Key -> Key -> a -> IntMap (IntMap a) -> IntMap (IntMap a) Source #

=== IntMap-of-IntMap (IM2) stuff

fromListIM2 :: Foldable t => t (Key, Key, a) -> IntMap (IntMap a) -> IntMap (IntMap a) Source #

ifoldlIM2' :: (Key -> Key -> a -> b -> b) -> b -> IntMap (IntMap a) -> b Source #

folding

ifoldlIM2 :: (Key -> Key -> t -> IntMap a -> IntMap a) -> IntMap (IntMap t) -> IntMap a Source #

foldlIM2 :: (a -> b -> b) -> b -> IntMap (IntMap a) -> b Source #

ifilterIM2 :: (Key -> Key -> a -> Bool) -> IntMap (IntMap a) -> IntMap (IntMap a) Source #

filtering

rpairs :: (a, [b]) -> [(a, b)] Source #

mapIM2 :: (a -> b) -> IntMap (IntMap a) -> IntMap (IntMap b) Source #

mapping

imapIM2 :: (Key -> Key -> a -> b) -> IntMap (IntMap a) -> IntMap (IntMap b) Source #

mapKeysIM2 :: (Key -> Key) -> (Key -> Key) -> IntMap (IntMap a) -> IntMap (IntMap a) Source #

mapColumnIM2 :: (b -> b) -> IntMap (IntMap b) -> Int -> IntMap (IntMap b) Source #

Orphan instances

Set IntMap Source # 

Methods

liftU2 :: (a -> a -> a) -> IntMap a -> IntMap a -> IntMap a Source #

liftI2 :: (a -> b -> c) -> IntMap a -> IntMap b -> IntMap c Source #

Normed IntMap Source # 

Methods

norm :: (Floating a, Eq a) => a -> IntMap a -> a Source #

Hilbert IntMap Source # 

Methods

dot :: Num a => IntMap a -> IntMap a -> a Source #

VectorSpace IntMap Source # 

Methods

(.*) :: Num a => a -> IntMap a -> IntMap a Source #

Additive IntMap Source # 

Methods

zero :: Num a => IntMap a Source #

(^+^) :: Num a => IntMap a -> IntMap a -> IntMap a Source #