cons package:vector

cons :: forall a (v :: Type -> Type) . a -> Bundle v a -> Bundle v a

O(n) Prepend an element.

vector Data.Vector.Fusion.Bundle

Prepend an element

cons :: forall (m :: Type -> Type) a (v :: Type -> Type) . Monad m => a -> Bundle m v a -> Bundle m v a

vector Data.Vector.Fusion.Bundle.Monadic

Prepend an element

cons :: forall (m :: Type -> Type) a . Monad m => a -> Stream m a -> Stream m a

vector Data.Vector.Fusion.Stream.Monadic

cons :: Vector v a => a -> v a -> v a

cons :: Prim a => a -> Vector a -> Vector a

O(n) Prepend an element.

cons :: Storable a => a -> Vector a -> Vector a

O(n) Prepend an element.

cons :: Unbox a => a -> Vector a -> Vector a

O(n) Prepend an element.

constructN :: Int -> (Vector a -> a) -> Vector a

O(n) Prepend an element.

constructrN :: Int -> (Vector a -> a) -> Vector a

O(n) Construct a vector with n elements by repeatedly applying the generator function to the already constructed part of the vector.

constructN 3 f = let a = f <> ; b = f <a> ; c = f <a,b> in <a,b,c>

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

O(n) Construct a vector with n elements from right to left by repeatedly applying the generator function to the already constructed part of the vector.

constructrN 3 f = let a = f <> ; b = f<a> ; c = f <b,a> in <c,b,a>

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

O(n) Construct a vector with n elements by repeatedly applying the generator function to the already constructed part of the vector.

constructN 3 f = let a = f <> ; b = f <a> ; c = f <a,b> in <a,b,c>

constructN :: Prim a => Int -> (Vector a -> a) -> Vector a

O(n) Construct a vector with n elements from right to left by repeatedly applying the generator function to the already constructed part of the vector.

constructrN 3 f = let a = f <> ; b = f<a> ; c = f <b,a> in <c,b,a>

constructrN :: Prim a => Int -> (Vector a -> a) -> Vector a

O(n) Construct a vector with n elements by repeatedly applying the generator function to the already constructed part of the vector.

constructN 3 f = let a = f <> ; b = f <a> ; c = f <a,b> in <a,b,c>

constructN :: Storable a => Int -> (Vector a -> a) -> Vector a

O(n) Construct a vector with n elements from right to left by repeatedly applying the generator function to the already constructed part of the vector.

constructrN 3 f = let a = f <> ; b = f<a> ; c = f <b,a> in <c,b,a>

constructrN :: Storable a => Int -> (Vector a -> a) -> Vector a

O(n) Construct a vector with n elements by repeatedly applying the generator function to the already constructed part of the vector.

constructN 3 f = let a = f <> ; b = f <a> ; c = f <a,b> in <a,b,c>

constructN :: Unbox a => Int -> (Vector a -> a) -> Vector a

O(n) Construct a vector with n elements from right to left by repeatedly applying the generator function to the already constructed part of the vector.

constructrN 3 f = let a = f <> ; b = f<a> ; c = f <b,a> in <c,b,a>

constructrN :: Unbox a => Int -> (Vector a -> a) -> Vector a

O(n) Construct a vector with n elements by repeatedly applying the generator function to the already constructed part of the vector.

constructN 3 f = let a = f <> ; b = f <a> ; c = f <a,b> in <a,b,c>

uncons :: Vector a -> Maybe (a, Vector a)

O(n) Construct a vector with n elements from right to left by repeatedly applying the generator function to the already constructed part of the vector.

constructrN 3 f = let a = f <> ; b = f<a> ; c = f <b,a> in <c,b,a>

mkVecConstr :: String -> Constr

O(1) Yield the head and tail of the vector, or Nothing if the vector is empty.

uncons :: Vector v a => v a -> Maybe (a, v a)

uncons :: Prim a => Vector a -> Maybe (a, Vector a)

O(1) Yield the head and tail of the vector, or Nothing if the vector is empty.

uncons :: Storable a => Vector a -> Maybe (a, Vector a)

O(1) Yield the head and tail of the vector, or Nothing if the vector is empty.

uncons :: Unbox a => Vector a -> Maybe (a, Vector a)

O(1) Yield the head and tail of the vector, or Nothing if the vector is empty.