RIO.Vector · rio-0.1.22.0 · horizon-platform

Immutable vectors

1 declaration

classclass MVector (Mutable v) a => Vector (v :: Type -> Type) a where

#

Instances46Vector, …

Storable a => Vector Vector aDefined in vector-0.13.2.0 · Data.Vector.Storable
Prim a => Vector Vector aDefined in vector-0.13.2.0 · Data.Vector.Primitive
Vector Vector aDefined in vector-0.13.2.0 · Data.Vector
Vector Vector aDefined in vector-0.13.2.0 · Data.Vector.Strict
Vector Vector AllDefined in vector-0.13.2.0 · Data.Vector.Unboxed.Base
Vector Vector AnyDefined in vector-0.13.2.0 · Data.Vector.Unboxed.Base
Vector Vector Int16Defined in vector-0.13.2.0 · Data.Vector.Unboxed.Base
Vector Vector Int32Defined in vector-0.13.2.0 · Data.Vector.Unboxed.Base
Vector Vector Int64Defined in vector-0.13.2.0 · Data.Vector.Unboxed.Base
Vector Vector Int8Defined in vector-0.13.2.0 · Data.Vector.Unboxed.Base
Vector Vector Word16Defined in vector-0.13.2.0 · Data.Vector.Unboxed.Base
Vector Vector Word32Defined in vector-0.13.2.0 · Data.Vector.Unboxed.Base
Vector Vector Word64Defined in vector-0.13.2.0 · Data.Vector.Unboxed.Base
Vector Vector Word8Defined in vector-0.13.2.0 · Data.Vector.Unboxed.Base
Vector Vector BoolDefined in vector-0.13.2.0 · Data.Vector.Unboxed.Base
Vector Vector CharDefined in vector-0.13.2.0 · Data.Vector.Unboxed.Base
Vector Vector DoubleDefined in vector-0.13.2.0 · Data.Vector.Unboxed.Base
Vector Vector FloatDefined in vector-0.13.2.0 · Data.Vector.Unboxed.Base
Vector Vector IntDefined in vector-0.13.2.0 · Data.Vector.Unboxed.Base
Vector Vector WordDefined in vector-0.13.2.0 · Data.Vector.Unboxed.Base
Vector Vector ()Defined in vector-0.13.2.0 · Data.Vector.Unboxed.Base
NFData a => Vector Vector (DoNotUnboxNormalForm a)Defined in vector-0.13.2.0 · Data.Vector.Unboxed.Base
Prim a => Vector Vector (UnboxViaPrim a)Defined in vector-0.13.2.0 · Data.Vector.Unboxed.Base
Vector Vector (DoNotUnboxLazy a)Defined in vector-0.13.2.0 · Data.Vector.Unboxed.Base
Vector Vector (DoNotUnboxStrict a)Defined in vector-0.13.2.0 · Data.Vector.Unboxed.Base
Unbox a => Vector Vector (Complex a)Defined in vector-0.13.2.0 · Data.Vector.Unboxed.Base
Unbox a => Vector Vector (First a)Defined in vector-0.13.2.0 · Data.Vector.Unboxed.Base
Unbox a => Vector Vector (Last a)Defined in vector-0.13.2.0 · Data.Vector.Unboxed.Base
Unbox a => Vector Vector (Max a)Defined in vector-0.13.2.0 · Data.Vector.Unboxed.Base
Unbox a => Vector Vector (Min a)Defined in vector-0.13.2.0 · Data.Vector.Unboxed.Base
Unbox a => Vector Vector (WrappedMonoid a)Defined in vector-0.13.2.0 · Data.Vector.Unboxed.Base
Unbox a => Vector Vector (Identity a)Defined in vector-0.13.2.0 · Data.Vector.Unboxed.Base
Unbox a => Vector Vector (Down a)Defined in vector-0.13.2.0 · Data.Vector.Unboxed.Base
Unbox a => Vector Vector (Dual a)Defined in vector-0.13.2.0 · Data.Vector.Unboxed.Base
Unbox a => Vector Vector (Product a)Defined in vector-0.13.2.0 · Data.Vector.Unboxed.Base
Unbox a => Vector Vector (Sum a)Defined in vector-0.13.2.0 · Data.Vector.Unboxed.Base
(IsoUnbox a b, Unbox b) => Vector Vector (As a b)Defined in vector-0.13.2.0 · Data.Vector.Unboxed.Base
(Unbox a, Unbox b) => Vector Vector (Arg a b)Defined in vector-0.13.2.0 · Data.Vector.Unboxed.Base
(Unbox a, Unbox b) => Vector Vector (a, b)Defined in vector-0.13.2.0 · Data.Vector.Unboxed.Base
Unbox (f a) => Vector Vector (Alt f a)Defined in vector-0.13.2.0 · Data.Vector.Unboxed.Base
Unbox a => Vector Vector (Const a b)Defined in vector-0.13.2.0 · Data.Vector.Unboxed.Base
(Unbox a, Unbox b, Unbox c) => Vector Vector (a, b, c)Defined in vector-0.13.2.0 · Data.Vector.Unboxed.Base
(Unbox a, Unbox b, Unbox c, Unbox d) => Vector Vector (a, b, c, d)Defined in vector-0.13.2.0 · Data.Vector.Unboxed.Base
Unbox (f (g a)) => Vector Vector (Compose f g a)Defined in vector-0.13.2.0 · Data.Vector.Unboxed.Base
(Unbox a, Unbox b, Unbox c, Unbox d, Unbox e) => Vector Vector (a, b, c, d, e)Defined in vector-0.13.2.0 · Data.Vector.Unboxed.Base
(Unbox a, Unbox b, Unbox c, Unbox d, Unbox e, Unbox f) => Vector Vector (a, b, c, d, e, f)Defined in vector-0.13.2.0 · Data.Vector.Unboxed.Base

Accessors

0 declarations

Length information

valuelength :: Vector v a => v a -> Int

#

valuenull :: Vector v a => v a -> Bool

#

Indexing

value(!?) :: Vector v a => v a -> Int -> Maybe a

#

Extracting subvectors

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

#

valuetake :: Vector v a => Int -> v a -> v a

#

valuedrop :: Vector v a => Int -> v a -> v a

#

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

#

Construction

0 declarations

Initialisation

valueempty :: Vector v a => v a

#

valuesingleton :: Vector v a => a -> v a

#

valuereplicate :: Vector v a => Int -> a -> v a

#

valuegenerate :: Vector v a => Int -> (Int -> a) -> v a

#

valueiterateN :: Vector v a => Int -> (a -> a) -> a -> v a

#

Monadic initialisation

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

#

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

#

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

#

valuecreate :: Vector v a => (forall s. ST s (Mutable v s a)) -> v a

#

valuecreateT

:: (Traversable f, Vector v a)
=> forall s. ST s (f (Mutable v s a))
-> f (v a)

#

Unfolding

valueunfoldr :: Vector v a => (b -> Maybe (a, b)) -> b -> v a

#

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

#

valueunfoldrM :: (Monad m, Vector v a) => (b -> m (Maybe (a, b))) -> b -> m (v a)

#

valueunfoldrNM

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

#

valueconstructN :: Vector v a => Int -> (v a -> a) -> v a

#

valueconstructrN :: Vector v a => Int -> (v a -> a) -> v a

#

Enumeration

valueenumFromN :: (Vector v a, Num a) => a -> Int -> v a

#

valueenumFromStepN :: (Vector v a, Num a) => a -> a -> Int -> v a

#

valueenumFromTo :: (Vector v a, Enum a) => a -> a -> v a

#

valueenumFromThenTo :: (Vector v a, Enum a) => a -> a -> a -> v a

#

Concatenation

valuecons :: Vector v a => a -> v a -> v a

#

valuesnoc :: Vector v a => v a -> a -> v a

#

value(++) :: Vector v a => v a -> v a -> v a

#

valueconcat :: Vector v a => [v a] -> v a

#

valueconcatNE :: Vector v a => NonEmpty (v a) -> v a

#

Restricting memory usage

valueforce :: Vector v a => v a -> v a

#

Modifying vectors

0 declarations

Permutations

valuereverse :: Vector v a => v a -> v a

#

Safe destructive update

valuemodify :: Vector v a => (forall s. Mutable v s a -> ST s ()) -> v a -> v a

#

Elementwise operations

0 declarations

Indexing

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

#

Mapping

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

#

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

#

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

#

Monadic mapping

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

#

valueimapM

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

#

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

#

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

#

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

#

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

#

Zipping

valuezipWith

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

#

valuezipWith3

:: (Vector v a, Vector v b, Vector v c, Vector v d)
=> a -> b -> c -> d
-> v a
-> v b
-> v c
-> v d

#

valuezipWith4

:: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e)
=> a -> b -> c -> d -> e
-> v a
-> v b
-> v c
-> v d
-> v e

#

valuezipWith5

:: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v f)
=> a -> b -> c -> d -> e -> f
-> v a
-> v b
-> v c
-> v d
-> v e
-> v f

#

valuezipWith6

:: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v f, Vector v g)
=> a -> b -> c -> d -> e -> f -> g
-> v a
-> v b
-> v c
-> v d
-> v e
-> v f
-> v g

#

valueizipWith

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

#

valueizipWith3

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

#

valueizipWith4

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

#

valueizipWith5

:: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v f)
=> Int -> a -> b -> c -> d -> e -> f
-> v a
-> v b
-> v c
-> v d
-> v e
-> v f

#

valueizipWith6

:: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v f, Vector v g)
=> Int -> a -> b -> c -> d -> e -> f -> g
-> v a
-> v b
-> v c
-> v d
-> v e
-> v f
-> v g

#

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

#

valuezip3

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

#

valuezip4

:: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v (a, b, c, d))
=> v a
-> v b
-> v c
-> v d
-> v (a, b, c, d)

#

valuezip5

:: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v (a, b, c, d, e))
=> v a
-> v b
-> v c
-> v d
-> v e
-> v (a, b, c, d, e)

#

valuezip6

:: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v f, Vector v (a, b, c, d, e, f))
=> v a
-> v b
-> v c
-> v d
-> v e
-> v f
-> v (a, b, c, d, e, f)

#

Monadic zipping

valuezipWithM

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

#

valueizipWithM

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

#

valuezipWithM_

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

#

valueizipWithM_

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

#

Unzipping

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

#

valueunzip3

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

#

valueunzip4

:: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v (a, b, c, d))
=> v (a, b, c, d)
-> (v a, v b, v c, v d)

#

valueunzip5

:: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v (a, b, c, d, e))
=> v (a, b, c, d, e)
-> (v a, v b, v c, v d, v e)

#

valueunzip6

:: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v f, Vector v (a, b, c, d, e, f))
=> v (a, b, c, d, e, f)
-> (v a, v b, v c, v d, v e, v f)

#

Working with predicates

0 declarations

Filtering

valuefilter :: Vector v a => (a -> Bool) -> v a -> v a

#

valueifilter :: Vector v a => (Int -> a -> Bool) -> v a -> v a

#

valueuniq :: (Vector v a, Eq a) => v a -> v a

#

valuemapMaybe :: (Vector v a, Vector v b) => (a -> Maybe b) -> v a -> v b

#

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

#

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

#

valuetakeWhile :: Vector v a => (a -> Bool) -> v a -> v a

#

valuedropWhile :: Vector v a => (a -> Bool) -> v a -> v a

#

Partitioning

valuepartition :: Vector v a => (a -> Bool) -> v a -> (v a, v a)

#

valueunstablePartition :: Vector v a => (a -> Bool) -> v a -> (v a, v a)

#

valuespan :: Vector v a => (a -> Bool) -> v a -> (v a, v a)

#

valuebreak :: Vector v a => (a -> Bool) -> v a -> (v a, v a)

#

Searching

valueelem :: (Vector v a, Eq a) => a -> v a -> Bool

#

valuenotElem :: (Vector v a, Eq a) => a -> v a -> Bool

#

valuefind :: Vector v a => (a -> Bool) -> v a -> Maybe a

#

valuefindIndex :: Vector v a => (a -> Bool) -> v a -> Maybe Int

#

valuefindIndices :: (Vector v a, Vector v Int) => (a -> Bool) -> v a -> v Int

#

valueelemIndex :: (Vector v a, Eq a) => a -> v a -> Maybe Int

#

valueelemIndices :: (Vector v a, Vector v Int, Eq a) => a -> v a -> v Int

#

Folding

8 declarations

valuefoldl :: Vector v b => (a -> b -> a) -> a -> v b -> a

#

valuefoldl' :: Vector v b => (a -> b -> a) -> a -> v b -> a

#

valuefoldr :: Vector v a => (a -> b -> b) -> b -> v a -> b

#

valuefoldr' :: Vector v a => (a -> b -> b) -> b -> v a -> b

#

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

#

valueifoldl' :: Vector v b => (a -> Int -> b -> a) -> a -> v b -> a

#

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

#

valueifoldr' :: Vector v a => (Int -> a -> b -> b) -> b -> v a -> b

#

Specialised folds

valueall :: Vector v a => (a -> Bool) -> v a -> Bool

#

valueany :: Vector v a => (a -> Bool) -> v a -> Bool

#

valueand :: Vector v Bool => v Bool -> Bool

#

valueor :: Vector v Bool => v Bool -> Bool

#

valuesum :: (Vector v a, Num a) => v a -> a

#

valueproduct :: (Vector v a, Num a) => v a -> a

#

Monadic folds

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

#

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

#

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

#

valueifoldM'

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

#

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

#

valueifoldM_

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

#

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

#

valueifoldM'_

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

#

Monadic sequencing

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

#

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

#

Prefix sums (scans)

16 declarations

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

#

valueprescanl' :: (Vector v a, Vector v b) => (a -> b -> a) -> a -> v b -> v a

#

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

#

valuepostscanl' :: (Vector v a, Vector v b) => (a -> b -> a) -> a -> v b -> v a

#

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

#

valuescanl' :: (Vector v a, Vector v b) => (a -> b -> a) -> a -> v b -> v a

#

valueiscanl

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

#

valueiscanl'

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

#

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

#

valueprescanr' :: (Vector v a, Vector v b) => (a -> b -> b) -> b -> v a -> v b

#

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

#

valuepostscanr' :: (Vector v a, Vector v b) => (a -> b -> b) -> b -> v a -> v b

#

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

#

valuescanr' :: (Vector v a, Vector v b) => (a -> b -> b) -> b -> v a -> v b

#

valueiscanr

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

#

valueiscanr'

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

#

Conversions

0 declarations

Lists

valuetoList :: Vector v a => v a -> [a]

#

valuefromList :: Vector v a => [a] -> v a

#

valuefromListN :: Vector v a => Int -> [a] -> v a

#

Different vector types

valueconvert :: (Vector v a, Vector w a) => v a -> w a

#

Mutable vectors

valuefreeze :: (PrimMonad m, Vector v a) => Mutable v (PrimState m) a -> m (v a)

#

valuethaw :: (PrimMonad m, Vector v a) => v a -> m (Mutable v (PrimState m) a)

#

valuecopy

:: (HasCallStack, PrimMonad m, Vector v a)
=> Mutable v (PrimState m) a
-> v a
-> m ()

#

Fusion support

0 declarations

Conversion to/from Bundles

valuestream :: Vector v a => v a -> Bundle v a

#

valueunstream :: Vector v a => Bundle v a -> v a

#

valuestreamR :: Vector v a => v a -> Bundle u a

#

valueunstreamR :: Vector v a => Bundle v a -> v a

#

Recycling support

valuenew :: Vector v a => New v a -> v a

#

valueclone :: Vector v a => v a -> New v a

#

Utilities

0 declarations

Comparisons

valueeq :: (Vector v a, Eq a) => v a -> v a -> Bool

#

valuecmp :: (Vector v a, Ord a) => v a -> v a -> Ordering

#

valueeqBy :: (Vector v a, Vector v b) => (a -> b -> Bool) -> v a -> v b -> Bool

#

valuecmpBy

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

#

Show and Read

valueshowsPrec :: (Vector v a, Show a) => Int -> v a -> ShowS

#

valuereadPrec :: (Vector v a, Read a) => ReadPrec (v a)

#

valueliftShowsPrec

:: Vector v a
=> Int -> a -> ShowS
-> [a] -> ShowS
-> Int
-> v a
-> ShowS

#

valueliftReadsPrec

:: Vector v a
=> Int -> ReadS a
-> ReadS [a]
-> Int
-> ReadS (v a)

#

`Data` and `Typeable`

valuegfoldl

:: (Vector v a, Data a)
=> forall d b. Data d => c (d -> b) -> d -> c b
-> forall g. g -> c g
-> v a
-> c (v a)

#

valuedataCast

:: (Vector v a, Data a, Typeable v, Typeable t)
=> forall d. Data d => c (t d)
-> Maybe (c (v a))

#

valuemkType :: String -> DataType

#

Deprecated. Use Data.Data.mkNoRepType

Immutable vectors

Accessors

Length information

Indexing

Extracting subvectors

Construction

Initialisation

Monadic initialisation

Unfolding

Enumeration

Concatenation

Restricting memory usage

Modifying vectors

Permutations

Safe destructive update

Elementwise operations

Indexing

Mapping

Monadic mapping

Zipping

Monadic zipping

Unzipping

Working with predicates

Filtering

Partitioning

Searching

Folding

Specialised folds

Monadic folds

Monadic sequencing

Prefix sums (scans)

Conversions

Lists

Different vector types

Mutable vectors

Fusion support

Conversion to/from Bundles

Recycling support

Utilities

Comparisons

Show and Read

Data and Typeable

`Data` and `Typeable`