Data.Sparse.SpVector

Sparse Vector

data SpVector a

Constructors

SV

Fields

• svDim :: Int
• svData :: IntMap a

Instances

Functor SpVector

Methods

fmap :: (a -> b) -> SpVector a -> SpVector b

(<$) :: a -> SpVector b -> SpVector a

Foldable SpVector

Methods

fold :: Monoid m => SpVector m -> m

foldMap :: Monoid m => (a -> m) -> SpVector a -> m

foldr :: (a -> b -> b) -> b -> SpVector a -> b

foldr' :: (a -> b -> b) -> b -> SpVector a -> b

foldl :: (b -> a -> b) -> b -> SpVector a -> b

foldl' :: (b -> a -> b) -> b -> SpVector a -> b

foldr1 :: (a -> a -> a) -> SpVector a -> a

foldl1 :: (a -> a -> a) -> SpVector a -> a

toList :: SpVector a -> [a]

null :: SpVector a -> Bool

length :: SpVector a -> Int

elem :: Eq a => a -> SpVector a -> Bool

maximum :: Ord a => SpVector a -> a

minimum :: Ord a => SpVector a -> a

sum :: Num a => SpVector a -> a

product :: Num a => SpVector a -> a

Set SpVector

Methods

liftU2 :: (a -> a -> a) -> SpVector a -> SpVector a -> SpVector a

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

FiniteDim SpVector

Associated Types

type FDSize (SpVector :: * -> *) :: *

Methods

dim :: SpVector a -> FDSize SpVector

Normed SpVector

Methods

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

Hilbert SpVector

Methods

dot :: Num a => SpVector a -> SpVector a -> a

VectorSpace SpVector

Methods

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

Additive SpVector

Methods

zero :: Num a => SpVector a

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

Sparse SpVector a

Methods

spy :: Fractional b => SpVector a -> b

HasData SpVector a

Associated Types

type HDData (SpVector :: * -> *) a :: *

Methods

dat :: SpVector a -> HDData SpVector a

Eq a => Eq (SpVector a)

Methods

(==) :: SpVector a -> SpVector a -> Bool

(/=) :: SpVector a -> SpVector a -> Bool

Show a => Show (SpVector a)

Methods

showsPrec :: Int -> SpVector a -> ShowS

show :: SpVector a -> String

showList :: [SpVector a] -> ShowS

type FDSize SpVector

type FDSize SpVector = Int

type HDData SpVector a

type HDData SpVector a = IntMap a

spySV :: Fractional b => SpVector a -> b

SpVector sparsity

nzSV :: SpVector a -> Int

Number of nonzeros

sizeStrSV :: SpVector a -> String

Creation

zeroSV :: Int -> SpVector a

empty sparse vector (length n, no entries)

singletonSV :: a -> SpVector a

singleton sparse vector (length 1)

mkSpVector :: (Num a, Eq a) => Int -> IntMap a -> SpVector a

create a sparse vector from an association list while discarding all zero entries

mkSpVectorD :: (Num a, Eq a) => Int -> [a] -> SpVector a

", from logically dense array (consecutive indices)

mkSpVector1 :: Int -> IntMap a -> SpVector a

fromListDenseSV :: Int -> [a] -> SpVector a

Create new sparse vector, assumin 0-based, contiguous indexing

oneHotSVU :: Num a => Int -> IxRow -> SpVector a

one-hot encoding : `oneHotSV n k` produces a SpVector of length n having 1 at the k-th position

oneHotSV :: Num a => Int -> IxRow -> SpVector a

onesSV :: Num a => Int -> SpVector a

DENSE vector of `1`s

zerosSV :: Num a => Int -> SpVector a

DENSE vector of `0`s

Element insertion

insertSpVector :: Int -> a -> SpVector a -> SpVector a

insert element x at index i in a preexisting SpVector

fromList

fromListSV :: Int -> [(Int, a)] -> SpVector a

toList

toListSV :: SpVector a -> [(Key, a)]

toDenseListSV :: Num b => SpVector b -> [b]

To dense list (default = 0)

Lookup

lookupSV :: Key -> SpVector a -> Maybe a

Lookup an index in a SpVector

lookupDefaultSV :: a -> Key -> SpVector a -> a

Lookup an index, return a default value if lookup fails

lookupDenseSV :: Num a => Key -> SpVector a -> a

Lookup an index in a SpVector, returns 0 if lookup fails

Sub-vectors

tailSV :: SpVector a -> SpVector a

Tail elements

headSV :: Num a => SpVector a -> a

Head element

concatSV :: SpVector a -> SpVector a -> SpVector a

Concatenate two sparse vectors

filterSV :: (a -> Bool) -> SpVector a -> SpVector a

Filter

ifilterSV :: (Int -> a -> Bool) -> SpVector a -> SpVector a

Indexed filter

Orthogonal vector

orthogonalSV :: Fractional a => SpVector a -> SpVector a

Generate an arbitrary (not random) vector u such that `v dot u = 0`