Numeric.LinearAlgebra.Sparse.IntMap

Documentation

set-like brackets

Insertion

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

Insert an element

Lookup

lookupIM2 :: Key -> Key -> IntMap (IntMap a) -> Maybe a

Lookup a key

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

Ppopulate an IM2 from a list of (row index, column index, value)

folding

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

Indexed left fold over an IM2, with general accumulator

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

Indexed left fold over an IM2

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

Left fold over an IM2, with general accumulator

transposeIM2 :: IntMap (IntMap a) -> IntMap (IntMap a)

Inner indices become outer ones and vice versa. No loss of information because both inner and outer IntMaps are nubbed.

filtering

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

Map over outer IM and filter all inner IM's

filterSubdiag :: IntMap (IntMap a) -> IntMap (IntMap a)

Specialized filtering : keep only sub-diagonal elements

countSubdiagonalNZ :: IntMap (IntMap a) -> Int

subdiagIndices :: IntMap (IntMap a) -> [(Key, Key)]

List of (row, col) indices of (nonzero) subdiagonal elements

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

mapping

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

Map over IM2

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

Indexed map over IM2

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

Mapping keys

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

Orphan instances

Set IntMap

Methods

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

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

Normed IntMap

Methods

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

Hilbert IntMap

Methods

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

VectorSpace IntMap

Methods

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

Additive IntMap

Methods

zero :: Num a => IntMap a

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