Modulebasement-0.0.16Haskell2010

Basement.Sized.UVect

newtypenewtype UVect (n :: Nat) a

Instances3Eq, Show, NormalForm

PrimType a => Eq (UVect n a)Defined in basement-0.0.16 · Basement.Sized.UVect
(PrimType a, Show a) => Show (UVect n a)Defined in basement-0.0.16 · Basement.Sized.UVect
NormalForm (UVect n a)Defined in basement-0.0.16 · Basement.Sized.UVect

newtypenewtype MUVect (n :: Nat) ty st

valueunUVect :: UVect n a -> UArray a

valuetoUVect

valueempty :: PrimType ty => UVect 0 ty

valuesingleton :: PrimType ty => ty -> UVect 1 ty

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

valuethaw

valuefreeze

valueindex :: PrimType ty => UVect n ty -> Offset ty -> ty

valuemap :: (PrimType a, PrimType b) => (a -> b) -> UVect n a -> UVect n b

valuefoldl' :: PrimType ty => (a -> ty -> a) -> a -> UVect n ty -> a

valuefoldr :: PrimType ty => (ty -> a -> a) -> a -> UVect n ty -> a

valuecons :: PrimType ty => ty -> UVect n ty -> UVect (n + 1) ty

valuesnoc :: PrimType ty => UVect n ty -> ty -> UVect (n + 1) ty

valueelem :: PrimType ty => ty -> UVect n ty -> Bool

valuesub

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

valueuncons

valueunsnoc

valuesplitAt

valueall :: PrimType ty => (ty -> Bool) -> UVect n ty -> Bool

valueany :: PrimType ty => (ty -> Bool) -> UVect n ty -> Bool

valuefind :: PrimType ty => (ty -> Bool) -> UVect n ty -> Maybe ty

valuereverse :: PrimType ty => UVect n ty -> UVect n ty

valuesortBy :: PrimType ty => (ty -> ty -> Ordering) -> UVect n ty -> UVect n ty

valueintersperse