Modulerio-0.1.25.0Haskell2010

RIO.Vector.Storable.Partial

Storable Vector partial functions. Import as:

import qualified RIO.Vector.Storable.Partial as VS'

Contents

Accessors
Indexing
Monadic indexing
Extracting subvectors
Modifying vectors
Bulk updates
Accumulations
Permutations
Folding
Specialised folds
Monadic folds
Prefix sums (scans)

Synopsis

value !
value head
value last
value indexM
value headM
value lastM
value init
value tail
value //
value update_
value accum
value accumulate_
value backpermute
value foldl1
value foldl1'
value foldr1
value foldr1'
value maximum
value maximumBy
value minimum
value minimumBy
value minIndex
value minIndexBy
value maxIndex
value maxIndexBy
value fold1M
value fold1M'
value fold1M_
value fold1M'_
value scanl1
value scanl1'
value scanr1
value scanr1'

Packagerio-0.1.25.0
Exports33
LanguageHaskell2010
LicenceMIT
SourcePartial.hs

Accessors

Indexing

value(!) :: Storable a => Vector a -> Int -> a

valuehead :: Storable a => Vector a -> a

valuelast :: Storable a => Vector a -> a

Monadic indexing

valueindexM :: (Storable a, Monad m) => Vector a -> Int -> m a

valueheadM :: (Storable a, Monad m) => Vector a -> m a

valuelastM :: (Storable a, Monad m) => Vector a -> m a

Extracting subvectors

valueinit :: Storable a => Vector a -> Vector a

valuetail :: Storable a => Vector a -> Vector a

Modifying vectors

Bulk updates

value(//) :: Storable a => Vector a -> [(Int, a)] -> Vector a

valueupdate_ :: Storable a => Vector a -> Vector Int -> Vector a -> Vector a

Accumulations

valueaccum :: Storable a => (a -> b -> a) -> Vector a -> [(Int, b)] -> Vector a

valueaccumulate_

:: (Storable a, Storable b)
=> a -> b -> a
-> Vector a
-> Vector Int
-> Vector b
-> Vector a

Permutations

valuebackpermute :: Storable a => Vector a -> Vector Int -> Vector a

Folding

valuefoldl1 :: Storable a => (a -> a -> a) -> Vector a -> a

valuefoldl1' :: Storable a => (a -> a -> a) -> Vector a -> a

valuefoldr1 :: Storable a => (a -> a -> a) -> Vector a -> a

valuefoldr1' :: Storable a => (a -> a -> a) -> Vector a -> a

Specialised folds

valuemaximum :: (Storable a, Ord a) => Vector a -> a

valuemaximumBy :: Storable a => (a -> a -> Ordering) -> Vector a -> a

valueminimum :: (Storable a, Ord a) => Vector a -> a

valueminimumBy :: Storable a => (a -> a -> Ordering) -> Vector a -> a

valueminIndex :: (Storable a, Ord a) => Vector a -> Int

valueminIndexBy :: Storable a => (a -> a -> Ordering) -> Vector a -> Int

valuemaxIndex :: (Storable a, Ord a) => Vector a -> Int

valuemaxIndexBy :: Storable a => (a -> a -> Ordering) -> Vector a -> Int

Monadic folds

valuefold1M :: (Monad m, Storable a) => (a -> a -> m a) -> Vector a -> m a

valuefold1M' :: (Monad m, Storable a) => (a -> a -> m a) -> Vector a -> m a

valuefold1M_ :: (Monad m, Storable a) => (a -> a -> m a) -> Vector a -> m ()

valuefold1M'_ :: (Monad m, Storable a) => (a -> a -> m a) -> Vector a -> m ()

Prefix sums (scans)

valuescanl1 :: Storable a => (a -> a -> a) -> Vector a -> Vector a

valuescanl1' :: Storable a => (a -> a -> a) -> Vector a -> Vector a

valuescanr1 :: Storable a => (a -> a -> a) -> Vector a -> Vector a

valuescanr1' :: Storable a => (a -> a -> a) -> Vector a -> Vector a