Modulebasement-0.0.16Haskell2010

Basement.Sized.Vect

newtypenewtype Vect (n :: Nat) a

Instances4Functor, Eq, Show, NormalForm

Functor (Vect n)Defined in basement-0.0.16 · Basement.Sized.Vect
Eq a => Eq (Vect n a)Defined in basement-0.0.16 · Basement.Sized.Vect
Show a => Show (Vect n a)Defined in basement-0.0.16 · Basement.Sized.Vect
NormalForm a => NormalForm (Vect n a)Defined in basement-0.0.16 · Basement.Sized.Vect

newtypenewtype MVect (n :: Nat) ty st

valueunVect :: Vect n a -> Array a

valuetoVect :: (KnownNat n, Countable ty n) => Array ty -> Maybe (Vect n ty)

valueempty :: Vect 0 ty

valuesingleton :: ty -> Vect 1 ty

valuereplicate :: (KnownNat n, Countable ty n) => ty -> Vect n ty

valuethaw

valuefreeze

valueindex :: Vect n ty -> Offset ty -> ty

valuemap :: (a -> b) -> Vect n a -> Vect n b

valuefoldl' :: (a -> ty -> a) -> a -> Vect n ty -> a

valuefoldr :: (ty -> a -> a) -> a -> Vect n ty -> a

valuecons :: ty -> Vect n ty -> Vect (n + 1) ty

valuesnoc :: Vect n ty -> ty -> Vect (n + 1) ty

valueelem :: Eq ty => ty -> Vect n ty -> Bool

valuesub

:: ((i <=? n) ~ 'True, (j <=? n) ~ 'True, (i <=? j) ~ 'True, KnownNat i, KnownNat j, Offsetable ty i, Offsetable ty j)
=> Vect n ty
-> Vect (j - i) ty

valueuncons

valueunsnoc

valuesplitAt

valueall :: (ty -> Bool) -> Vect n ty -> Bool

valueany :: (ty -> Bool) -> Vect n ty -> Bool

valuefind :: (ty -> Bool) -> Vect n ty -> Maybe ty

valuereverse :: Vect n ty -> Vect n ty

valuesortBy :: (ty -> ty -> Ordering) -> Vect n ty -> Vect n ty

valueintersperse :: CmpNat n 1 ~ 'GT => ty -> Vect n ty -> Vect ((n + n) - 1) ty