Data.Vector.Generic.Static

Documentation

newtype Vec n v a

Constructors

Vec

Fields

unVec :: v a

Instances

Eq (v a) => Eq (Vec n v a)

Ord (v a) => Ord (Vec n v a)

Show (v a) => Show (Vec n v a)

length :: forall n v a. Reify n => Vec n v a -> Nat n

null :: forall n v a. Reify n => Vec n v a -> Bool

empty :: Vector v a => Vec Z v a

singleton :: Vector v a => a -> Vec (S Z) v a

cons :: Vector v a => a -> Vec n v a -> Vec (S n) v a

snoc :: Vector v a => Vec n v a -> a -> Vec (S n) v a

replicate :: forall a n v. (Vector v a, Reify n) => a -> Vec n v a

generate :: forall n v a. (Vector v a, Reify n) => (Fin n -> a) -> Vec n v a

(++) :: Vector v a => Vec m v a -> Vec n v a -> Vec (m :+: n) v a

copy :: Vector v a => Vec n v a -> Vec n v a

(!) :: Vector v a => Vec n v a -> Fin n -> a

head :: Vector v a => Vec (S n) v a -> a

last :: Vector v a => Vec (S n) v a -> a

indexM :: (Vector v a, Monad m) => Vec n v a -> Fin n -> m a

headM :: (Vector v a, Monad m) => Vec (S n) v a -> m a

lastM :: (Vector v a, Monad m) => Vec (S n) v a -> m a

slice :: forall n k v a. (Vector v a, Reify k) => Fin n -> Vec (n :+: k) v a -> Vec k v a

init :: Vector v a => Vec (S n) v a -> Vec n v a

tail :: Vector v a => Vec (S n) v a -> Vec n v a

take :: forall n k v a. (Vector v a, Reify k) => Vec (n :+: k) v a -> Vec k v a

drop :: forall n k v a. (Vector v a, Reify k) => Vec (n :+: k) v a -> Vec n v a

backpermute :: (Vector v a, Vector v Int) => Vec m v a -> Vec n v (Fin m) -> Vec n v a

reverse :: Vector v a => Vec n v a -> Vec n v a

map :: (Vector v a, Vector v b) => (a -> b) -> Vec n v a -> Vec n v b

imap :: (Vector v a, Vector v b) => (Fin n -> a -> b) -> Vec n v a -> Vec n v b

concatMap :: (Vector v a, Vector v b) => (a -> Vec n v b) -> Vec m v a -> Vec (m :*: n) v b

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

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

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

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

zipWith6 :: (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) -> Vec n v a -> Vec n v b -> Vec n v c -> Vec n v d -> Vec n v e -> Vec n v f -> Vec n v g

izipWith :: (Vector v a, Vector v b, Vector v c) => (Fin n -> a -> b -> c) -> Vec n v a -> Vec n v b -> Vec n v c

izipWith3 :: (Vector v a, Vector v b, Vector v c, Vector v d) => (Fin n -> a -> b -> c -> d) -> Vec n v a -> Vec n v b -> Vec n v c -> Vec n v d

izipWith4 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e) => (Fin n -> a -> b -> c -> d -> e) -> Vec n v a -> Vec n v b -> Vec n v c -> Vec n v d -> Vec n v e

izipWith5 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v f) => (Fin n -> a -> b -> c -> d -> e -> f) -> Vec n v a -> Vec n v b -> Vec n v c -> Vec n v d -> Vec n v e -> Vec n v f

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

zip :: (Vector v a, Vector v b, Vector v (a, b)) => Vec n v a -> Vec n v b -> Vec n v (a, b)

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

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

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

zip6 :: (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)) => Vec n v a -> Vec n v b -> Vec n v c -> Vec n v d -> Vec n v e -> Vec n v f -> Vec n v (a, b, c, d, e, f)

unzip :: (Vector v a, Vector v b, Vector v (a, b)) => Vec n v (a, b) -> (Vec n v a, Vec n v b)

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

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

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

unzip6 :: (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)) => Vec n v (a, b, c, d, e, f) -> (Vec n v a, Vec n v b, Vec n v c, Vec n v d, Vec n v e, Vec n v f)

elem :: (Vector v a, Eq a) => a -> Vec n v a -> Bool

notElem :: (Vector v a, Eq a) => a -> Vec n v a -> Bool

find :: (Vector v a, Eq a) => (a -> Bool) -> Vec n v a -> Maybe a

findIndex :: Vector v a => (a -> Bool) -> Vec n v a -> Maybe (Fin n)

elemIndex :: Vector v a => Eq a => a -> Vec n v a -> Maybe (Fin n)

foldl :: Vector v b => (a -> b -> a) -> a -> Vec n v b -> a

foldl1 :: Vector v a => (a -> a -> a) -> Vec (S n) v a -> a

foldl' :: Vector v b => (a -> b -> a) -> a -> Vec n v b -> a

foldl1' :: Vector v a => (a -> a -> a) -> Vec (S n) v a -> a

foldr :: Vector v a => (a -> b -> b) -> b -> Vec n v a -> b

foldr1 :: Vector v a => (a -> a -> a) -> Vec (S n) v a -> a

foldr' :: Vector v a => (a -> b -> b) -> b -> Vec n v a -> b

foldr1' :: Vector v a => (a -> a -> a) -> Vec (S n) v a -> a

ifoldl :: Vector v b => (a -> Fin n -> b -> a) -> a -> Vec n v b -> a

ifoldl' :: Vector v b => (a -> Fin n -> b -> a) -> a -> Vec n v b -> a

ifoldr :: Vector v a => (Fin n -> a -> b -> b) -> b -> Vec n v a -> b

ifoldr' :: Vector v a => (Fin n -> a -> b -> b) -> b -> Vec n v a -> b

all :: Vector v a => (a -> Bool) -> Vec n v a -> Bool

any :: Vector v a => (a -> Bool) -> Vec n v a -> Bool

and :: Vector v Bool => Vec n v Bool -> Bool

or :: Vector v Bool => Vec n v Bool -> Bool

sum :: (Vector v a, Num a) => Vec n v a -> a

product :: (Vector v a, Num a) => Vec n v a -> a

minimum :: (Ord a, Vector v a) => Vec (S n) v a -> a

minimumBy :: Vector v a => (a -> a -> Ordering) -> Vec (S n) v a -> a

minIndex :: (Ord a, Vector v a) => Vec (S n) v a -> Fin (S n)

minIndexBy :: Vector v a => (a -> a -> Ordering) -> Vec (S n) v a -> Fin (S n)

maximum :: (Ord a, Vector v a) => Vec (S n) v a -> a

maximumBy :: Vector v a => (a -> a -> Ordering) -> Vec (S n) v a -> a

maxIndex :: (Ord a, Vector v a) => Vec (S n) v a -> Fin (S n)

maxIndexBy :: Vector v a => (a -> a -> Ordering) -> Vec (S n) v a -> Fin (S n)

unfoldr :: Vector v a => (b -> Maybe (a, b)) -> b -> (forall n. Vec n v a -> r) -> r

enumFromN :: forall v a n. (Vector v a, Num a, Reify n) => a -> Vec n v a

enumFromStepN :: forall v a n. (Vector v a, Num a, Reify n) => a -> a -> Vec n v a

toList :: Vector v a => Vec n v a -> [a]

fromList :: Vector v a => [a] -> (forall n. Vec n v a -> r) -> r

stream :: Vector v a => Vec n v a -> Stream a

unstream :: Vector v a => Stream a -> (forall n. Vec n v a -> r) -> r

streamR :: Vector v a => Vec n v a -> Stream a

unstreamR :: Vector v a => Stream a -> (forall n. Vec n v a -> r) -> r

new :: Vector v a => New a -> (forall n. Vec n v a -> r) -> r

allFin :: forall n v. (Vector v (Fin n), Reify n) => Vec n v (Fin n)

indexed :: (Vector v a, Vector v (Fin n, a)) => Vec n v a -> Vec n v (Fin n, a)