vector-static-0.1.2: Statically checked sizes on Data.Vector Source code Contents Index

Data.Vector.Static

Documentation

newtype Vec n a Source

Constructors Vec unVec :: Vec n Vector a Instances Reify n => Monad (Vec n) Functor (Vec n) Reify n => Applicative (Vec n)

diagonal :: Vec n (Vec n a) -> Vec n a Source

length :: Vec n a -> Nat n Source

empty :: Vec Z a Source

singleton :: a -> Vec (S Z) a Source

cons :: a -> Vec n a -> Vec (S n) a Source

snoc :: Vec n a -> a -> Vec (S n) a Source

replicate :: Nat n -> a -> Vec n a Source

generate :: Nat n -> (Fin n -> a) -> Vec n a Source

(++) :: Vec m a -> Vec n a -> Vec (m :+: n) a Source

copy :: Vec n a -> Vec n a Source

(!) :: Vec n a -> Fin n -> a Source

head :: Vec (S n) a -> a Source

last :: Vec (S n) a -> a Source

init :: Vec (S n) a -> Vec n a Source

tail :: Vec (S n) a -> Vec n a Source

backpermute :: Vec m a -> Vec n (Fin m) -> Vec n a Source

reverse :: Vec n a -> Vec n a Source

map :: (a -> b) -> Vec n a -> Vec n b Source

imap :: (Fin n -> a -> b) -> Vec n a -> Vec n b Source

concatMap :: (a -> Vec n b) -> Vec m a -> Vec (m :*: n) b Source

zipWith :: (a -> b -> c) -> Vec n a -> Vec n b -> Vec n c Source

zipWith3 :: (a -> b -> c -> d) -> Vec n a -> Vec n b -> Vec n c -> Vec n d Source

zipWith4 :: (a -> b -> c -> d -> e) -> Vec n a -> Vec n b -> Vec n c -> Vec n d -> Vec n e Source

zipWith5 :: (a -> b -> c -> d -> e -> f) -> Vec n a -> Vec n b -> Vec n c -> Vec n d -> Vec n e -> Vec n f Source

zipWith6 :: (a -> b -> c -> d -> e -> f -> g) -> Vec n a -> Vec n b -> Vec n c -> Vec n d -> Vec n e -> Vec n f -> Vec n g Source

izipWith :: (Fin n -> a -> b -> c) -> Vec n a -> Vec n b -> Vec n c Source

izipWith3 :: (Fin n -> a -> b -> c -> d) -> Vec n a -> Vec n b -> Vec n c -> Vec n d Source

izipWith4 :: (Fin n -> a -> b -> c -> d -> e) -> Vec n a -> Vec n b -> Vec n c -> Vec n d -> Vec n e Source

izipWith5 :: (Fin n -> a -> b -> c -> d -> e -> f) -> Vec n a -> Vec n b -> Vec n c -> Vec n d -> Vec n e -> Vec n f Source

izipWith6 :: (Fin n -> a -> b -> c -> d -> e -> f -> g) -> Vec n a -> Vec n b -> Vec n c -> Vec n d -> Vec n e -> Vec n f -> Vec n g Source

zip :: Vec n a -> Vec n b -> Vec n (a, b) Source

zip3 :: Vec n a -> Vec n b -> Vec n c -> Vec n (a, b, c) Source

zip4 :: Vec n a -> Vec n b -> Vec n c -> Vec n d -> Vec n (a, b, c, d) Source

zip5 :: Vec n a -> Vec n b -> Vec n c -> Vec n d -> Vec n e -> Vec n (a, b, c, d, e) Source

zip6 :: Vec n a -> Vec n b -> Vec n c -> Vec n d -> Vec n e -> Vec n f -> Vec n (a, b, c, d, e, f) Source

unzip :: Vec n (a, b) -> (Vec n a, Vec n b) Source

unzip3 :: Vec n (a, b, c) -> (Vec n a, Vec n b, Vec n c) Source

unzip4 :: Vec n (a, b, c, d) -> (Vec n a, Vec n b, Vec n c, Vec n d) Source

unzip5 :: Vec n (a, b, c, d, e) -> (Vec n a, Vec n b, Vec n c, Vec n d, Vec n e) Source

unzip6 :: Vec n (a, b, c, d, e, f) -> (Vec n a, Vec n b, Vec n c, Vec n d, Vec n e, Vec n f) Source

elem :: Eq a => a -> Vec n a -> Bool Source

notElem :: Eq a => a -> Vec n a -> Bool Source

find :: Eq a => (a -> Bool) -> Vec n a -> Maybe a Source

findIndex :: (a -> Bool) -> Vec n a -> Maybe (Fin n) Source

findIndices :: (a -> Bool) -> Vec n a -> Vec m (Fin n) Source

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

elemIndices :: Eq a => a -> Vec n a -> Vec m (Fin n) Source

foldl :: (a -> b -> a) -> a -> Vec n b -> a Source

foldl1 :: (a -> a -> a) -> Vec (S n) a -> a Source

foldl' :: (a -> b -> a) -> a -> Vec n b -> a Source

foldl1' :: (a -> a -> a) -> Vec (S n) a -> a Source

foldr :: (a -> b -> b) -> b -> Vec n a -> b Source

foldr1 :: (a -> a -> a) -> Vec (S n) a -> a Source

foldr' :: (a -> b -> b) -> b -> Vec n a -> b Source

foldr1' :: (a -> a -> a) -> Vec (S n) a -> a Source

ifoldl :: (a -> Fin n -> b -> a) -> a -> Vec n b -> a Source

ifoldl' :: (a -> Fin n -> b -> a) -> a -> Vec n b -> a Source

ifoldr :: (Fin n -> a -> b -> b) -> b -> Vec n a -> b Source

ifoldr' :: (Fin n -> a -> b -> b) -> b -> Vec n a -> b Source

all :: (a -> Bool) -> Vec n a -> Bool Source

any :: (a -> Bool) -> Vec n a -> Bool Source

and :: Vec n Bool -> Bool Source

or :: Vec n Bool -> Bool Source

sum :: Num a => Vec n a -> a Source

product :: Num a => Vec n a -> a Source

minimum :: Ord a => Vec (S n) a -> a Source

minimumBy :: (a -> a -> Ordering) -> Vec (S n) a -> a Source

minIndex :: Ord a => Vec (S n) a -> Fin (S n) Source

minIndexBy :: (a -> a -> Ordering) -> Vec (S n) a -> Fin (S n) Source

maximum :: Ord a => Vec (S n) a -> a Source

maximumBy :: (a -> a -> Ordering) -> Vec (S n) a -> a Source

maxIndex :: Ord a => Vec (S n) a -> Fin (S n) Source

maxIndexBy :: (a -> a -> Ordering) -> Vec (S n) a -> Fin (S n) Source

unfoldr :: (b -> Maybe (a, b)) -> b -> (forall n. Vec n a -> r) -> r Source

enumFromN :: forall a n. Num a => a -> Nat n -> Vec n a Source

enumFromStepN :: forall a n. Num a => a -> a -> Nat n -> Vec n a Source

toList :: Vec n a -> [a] Source

fromList :: [a] -> (forall n. Vec n a -> r) -> r Source

stream :: Vec n a -> Stream a Source

unstream :: Stream a -> (forall n. Vec n a -> r) -> r Source

streamR :: Vec n a -> Stream a Source

unstreamR :: Stream a -> (forall n. Vec n a -> r) -> r Source

new :: New a -> (forall n. Vec n a -> r) -> r Source

allFin :: Nat n -> Vec n (Fin n) Source

Produced by Haddock version 2.6.0