Add since pramgmas to haddock for functions and types that are new in 0.13.0.0

Author: lehins

vector/src/Data/Vector.hs

@@ -1716,6 +1716,8 @@ maximumBy = G.maximumBy
 -- (2,'a')
 -- >>> V.maximumOn fst $ V.fromList [(1,'a'), (1,'b')]
 -- (1,'a')
+--
+-- @since 0.13.0.0
 maximumOn :: Ord b => (a -> b) -> Vector a -> a
 {-# INLINE maximumOn #-}
 maximumOn = G.maximumOn
@@ -1764,6 +1766,8 @@ minimumBy = G.minimumBy
 -- (1,'b')
 -- >>> V.minimumOn fst $ V.fromList [(1,'a'), (1,'b')]
 -- (1,'a')
+--
+-- @since 0.13.0.0
 minimumOn :: Ord b => (a -> b) -> Vector a -> a
 {-# INLINE minimumOn #-}
 minimumOn = G.minimumOn

vector/src/Data/Vector/Generic.hs

@@ -1876,6 +1876,8 @@ maximumBy cmpr = Bundle.foldl1' maxBy . stream
 -- (2,'a')
 -- >>> V.maximumOn fst $ V.fromList [(1,'a'), (1,'b')]
 -- (1,'a')
+--
+-- @since 0.13.0.0
 maximumOn :: (Ord b, Vector v a) => (a -> b) -> v a -> a
 {-# INLINE maximumOn #-}
 maximumOn f = fst . Bundle.foldl1' maxBy . Bundle.map (\a -> (a, f a)) . stream
@@ -1934,6 +1936,8 @@ minimumBy cmpr = Bundle.foldl1' minBy . stream
 -- (1,'b')
 -- >>> V.minimumOn fst $ V.fromList [(1,'a'), (1,'b')]
 -- (1,'a')
+--
+-- @since 0.13.0.0
 minimumOn :: (Ord b, Vector v a) => (a -> b) -> v a -> a
 {-# INLINE minimumOn #-}
 minimumOn f = fst . Bundle.foldl1' minBy . Bundle.map (\a -> (a, f a)) . stream

vector/src/Data/Vector/Primitive.hs

@@ -1426,6 +1426,8 @@ maximumBy = G.maximumBy
 -- | /O(n)/ Yield the maximum element of the vector by comparing the results
 -- of a key function on each element. In case of a tie, the first occurrence
 -- wins. The vector may not be empty.
+--
+-- @since 0.13.0.0
 maximumOn :: (Ord b, Prim a) => (a -> b) -> Vector a -> a
 {-# INLINE maximumOn #-}
 maximumOn = G.maximumOn
@@ -1452,6 +1454,8 @@ minimumBy = G.minimumBy
 -- | /O(n)/ Yield the minimum element of the vector by comparing the results
 -- of a key function on each element. In case of a tie, the first occurrence
 -- wins. The vector may not be empty.
+--
+-- @since 0.13.0.0
 minimumOn :: (Ord b, Prim a) => (a -> b) -> Vector a -> a
 {-# INLINE minimumOn #-}
 minimumOn = G.minimumOn

vector/src/Data/Vector/Storable.hs

@@ -1473,6 +1473,8 @@ maximumBy = G.maximumBy
 -- | /O(n)/ Yield the maximum element of the vector by comparing the results
 -- of a key function on each element. In case of a tie, the first occurrence
 -- wins. The vector may not be empty.
+--
+-- @since 0.13.0.0
 maximumOn :: (Ord b, Storable a) => (a -> b) -> Vector a -> a
 {-# INLINE maximumOn #-}
 maximumOn = G.maximumOn
@@ -1499,6 +1501,8 @@ minimumBy = G.minimumBy
 -- | /O(n)/ Yield the minimum element of the vector by comparing the results
 -- of a key function on each element. In case of a tie, the first occurrence
 -- wins. The vector may not be empty.
+--
+-- @since 0.13.0.0
 minimumOn :: (Ord b, Storable a) => (a -> b) -> Vector a -> a
 {-# INLINE minimumOn #-}
 minimumOn = G.minimumOn

vector/src/Data/Vector/Unboxed.hs

@@ -1485,6 +1485,8 @@ maximumBy = G.maximumBy
 -- (2,'a')
 -- >>> VU.maximumOn fst $ VU.fromList [(1,'a'), (1 :: Int,'b')]
 -- (1,'a')
+--
+-- @since 0.13.0.0
 maximumOn :: (Ord b, Unbox a) => (a -> b) -> Vector a -> a
 {-# INLINE maximumOn #-}
 maximumOn = G.maximumOn
@@ -1535,6 +1537,8 @@ minimumBy = G.minimumBy
 -- (1,'b')
 -- >>> VU.minimumOn fst $ VU.fromList [(1,'a'), (1 :: Int,'b')]
 -- (1,'a')
+--
+-- @since 0.13.0.0
 minimumOn :: (Ord b, Unbox a) => (a -> b) -> Vector a -> a
 {-# INLINE minimumOn #-}
 minimumOn = G.minimumOn

vector/src/Data/Vector/Unboxed/Base.hs

@@ -214,6 +214,8 @@ instance G.Vector Vector () where
 -- >>> deriving via (U.UnboxViaPrim Int) instance M.MVector MVector Foo
 -- >>> deriving via (U.UnboxViaPrim Int) instance G.Vector  Vector  Foo
 -- >>> instance Unbox Foo
+--
+-- @since 0.13.0.0
 newtype UnboxViaPrim a = UnboxViaPrim a
 
 newtype instance MVector s (UnboxViaPrim a) = MV_UnboxViaPrim (P.MVector s a)
@@ -278,6 +280,7 @@ instance P.Prim a => G.Vector Vector (UnboxViaPrim a) where
 -- instance VU.IsoUnbox (Foo a) (Sum Int, Product a)
 -- :}
 --
+-- @since 0.13.0.0
 class IsoUnbox a b where
   -- | Convert value into it representation in unboxed vector.
   toURepr   :: a -> b
@@ -338,6 +341,7 @@ idU = id
 -- instance VU.Unbox a => VU.Unbox (Bar a)
 -- :}
 --
+-- @since 0.13.0.0
 newtype As (a :: Type) (b :: Type) = As a
 
 newtype instance MVector s (As a b) = MV_UnboxAs (MVector s b)