Modulerio-0.1.25.0Haskell2010

RIO.Vector.Partial

Generic Vector interface partial functions. Import as:

import qualified RIO.Vector.Partial as V'

35 values

Packagerio-0.1.25.0
Exports35
LanguageHaskell2010
LicenceMIT
SourcePartial.hs

Accessors

0 declarations

Indexing

value(!) :: (HasCallStack, Vector v a) => v a -> Int -> a

valuehead :: Vector v a => v a -> a

valuelast :: Vector v a => v a -> a

Monadic indexing

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

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

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

Extracting subvectors

valueinit :: Vector v a => v a -> v a

valuetail :: Vector v a => v a -> v a

Modifying vectors

0 declarations

Bulk updates

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

valueupdate :: (Vector v a, Vector v (Int, a)) => v a -> v (Int, a) -> v a

valueupdate_ :: (Vector v a, Vector v Int) => v a -> v Int -> v a -> v a

Accumulations

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

valueaccumulate

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

valueaccumulate_

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

Permutations

valuebackpermute

:: (HasCallStack, Vector v a, Vector v Int)
=> v a
-> v Int
-> v a

Folding

4 declarations

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

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

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

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

Specialised folds

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

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

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

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

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

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

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

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

Monadic folds

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

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

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

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

Prefix sums (scans)

4 declarations

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

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

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

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