Fix redundant word "the a" -> "a"

Author: adamse

Data/Vector.hs

@@ -576,9 +576,8 @@ unfoldr :: (b -> Maybe (a, b)) -> b -> Vector a
 unfoldr = G.unfoldr
 
 -- | /O(n)/ Construct a vector with at most @n@ elements by repeatedly applying
--- the generator function to the a seed. The generator function yields 'Just'
--- the next element and the new seed or 'Nothing' if there are no more
--- elements.
+-- the generator function to a seed. The generator function yields 'Just' the
+-- next element and the new seed or 'Nothing' if there are no more elements.
 --
 -- > unfoldrN 3 (\n -> Just (n,n-1)) 10 = <10,9,8>
 unfoldrN :: Int -> (b -> Maybe (a, b)) -> b -> Vector a

Data/Vector/Generic.hs

@@ -536,9 +536,8 @@ unfoldr :: Vector v a => (b -> Maybe (a, b)) -> b -> v a
 unfoldr f = unstream . Bundle.unfoldr f
 
 -- | /O(n)/ Construct a vector with at most @n@ elements by repeatedly applying
--- the generator function to the a seed. The generator function yields 'Just'
--- the next element and the new seed or 'Nothing' if there are no more
--- elements.
+-- the generator function to a seed. The generator function yields 'Just' the
+-- next element and the new seed or 'Nothing' if there are no more elements.
 --
 -- > unfoldrN 3 (\n -> Just (n,n-1)) 10 = <10,9,8>
 unfoldrN  :: Vector v a => Int -> (b -> Maybe (a, b)) -> b -> v a

Data/Vector/Primitive.hs

@@ -494,9 +494,8 @@ unfoldr :: Prim a => (b -> Maybe (a, b)) -> b -> Vector a
 unfoldr = G.unfoldr
 
 -- | /O(n)/ Construct a vector with at most @n@ elements by repeatedly applying
--- the generator function to the a seed. The generator function yields 'Just'
--- the next element and the new seed or 'Nothing' if there are no more
--- elements.
+-- the generator function to a seed. The generator function yields 'Just' the
+-- next element and the new seed or 'Nothing' if there are no more elements.
 --
 -- > unfoldrN 3 (\n -> Just (n,n-1)) 10 = <10,9,8>
 unfoldrN :: Prim a => Int -> (b -> Maybe (a, b)) -> b -> Vector a

Data/Vector/Storable.hs

@@ -504,9 +504,8 @@ unfoldr :: Storable a => (b -> Maybe (a, b)) -> b -> Vector a
 unfoldr = G.unfoldr
 
 -- | /O(n)/ Construct a vector with at most @n@ elements by repeatedly applying
--- the generator function to the a seed. The generator function yields 'Just'
--- the next element and the new seed or 'Nothing' if there are no more
--- elements.
+-- the generator function to a seed. The generator function yields 'Just' the
+-- next element and the new seed or 'Nothing' if there are no more elements.
 --
 -- > unfoldrN 3 (\n -> Just (n,n-1)) 10 = <10,9,8>
 unfoldrN :: Storable a => Int -> (b -> Maybe (a, b)) -> b -> Vector a

Data/Vector/Unboxed.hs

@@ -474,9 +474,8 @@ unfoldr :: Unbox a => (b -> Maybe (a, b)) -> b -> Vector a
 unfoldr = G.unfoldr
 
 -- | /O(n)/ Construct a vector with at most @n@ elements by repeatedly applying
--- the generator function to the a seed. The generator function yields 'Just'
--- the next element and the new seed or 'Nothing' if there are no more
--- elements.
+-- the generator function to a seed. The generator function yields 'Just' the
+-- next element and the new seed or 'Nothing' if there are no more elements.
 --
 -- > unfoldrN 3 (\n -> Just (n,n-1)) 10 = <10,9,8>
 unfoldrN :: Unbox a => Int -> (b -> Maybe (a, b)) -> b -> Vector a