Merge pull request #469 from toyboot4e/export-findIndexR

Export `findIndexR` from the non-generic vector modules

vector/src/Data/Vector.hs

@@ -125,7 +125,7 @@ module Data.Vector (
  partition, unstablePartition, partitionWith, span, break, groupBy, group,
 
  -- ** Searching
- elem, notElem, find, findIndex, findIndices, elemIndex, elemIndices,
+ elem, notElem, find, findIndex, findIndexR, findIndices, elemIndex, elemIndices,
 
  -- * Folding
  foldl, foldl1, foldl', foldl1', foldr, foldr1, foldr', foldr1',
@@ -1477,6 +1477,14 @@ findIndex :: (a -> Bool) -> Vector a -> Maybe Int
 {-# INLINE findIndex #-}
 findIndex = G.findIndex
 
+-- | /O(n)/ Yield 'Just' the index of the /last/ element matching the predicate
+-- or 'Nothing' if no such element exists.
+--
+-- Does not fuse.
+findIndexR :: (a -> Bool) -> Vector a -> Maybe Int
+{-# INLINE findIndexR #-}
+findIndexR = G.findIndexR
+
 -- | /O(n)/ Yield the indices of elements satisfying the predicate in ascending
 -- order.
 findIndices :: (a -> Bool) -> Vector a -> Vector Int

vector/src/Data/Vector/Generic.hs

@@ -1620,6 +1620,8 @@ findIndex f = Bundle.findIndex f . stream
 -- | /O(n)/ Yield 'Just' the index of the /last/ element matching the predicate
 -- or 'Nothing' if no such element exists.
 --
+-- Does not fuse.
+--
 -- @since 0.12.2.0
 findIndexR :: Vector v a => (a -> Bool) -> v a -> Maybe Int
 {-# INLINE findIndexR #-}

vector/src/Data/Vector/Primitive.hs

@@ -110,7 +110,7 @@ module Data.Vector.Primitive (
  partition, unstablePartition, partitionWith, span, break, groupBy, group,
 
  -- ** Searching
- elem, notElem, find, findIndex, findIndices, elemIndex, elemIndices,
+ elem, notElem, find, findIndex, findIndexR, findIndices, elemIndex, elemIndices,
 
  -- * Folding
  foldl, foldl1, foldl', foldl1', foldr, foldr1, foldr', foldr1',
@@ -1233,6 +1233,14 @@ findIndex :: Prim a => (a -> Bool) -> Vector a -> Maybe Int
 {-# INLINE findIndex #-}
 findIndex = G.findIndex
 
+-- | /O(n)/ Yield 'Just' the index of the /last/ element matching the predicate
+-- or 'Nothing' if no such element exists.
+--
+-- Does not fuse.
+findIndexR :: Prim a => (a -> Bool) -> Vector a -> Maybe Int
+{-# INLINE findIndexR #-}
+findIndexR = G.findIndexR
+
 -- | /O(n)/ Yield the indices of elements satisfying the predicate in ascending
 -- order.
 findIndices :: Prim a => (a -> Bool) -> Vector a -> Vector Int

vector/src/Data/Vector/Storable.hs

@@ -107,7 +107,7 @@ module Data.Vector.Storable (
  partition, unstablePartition, partitionWith, span, break, groupBy, group,
 
  -- ** Searching
- elem, notElem, find, findIndex, findIndices, elemIndex, elemIndices,
+ elem, notElem, find, findIndex, findIndexR, findIndices, elemIndex, elemIndices,
 
  -- * Folding
  foldl, foldl1, foldl', foldl1', foldr, foldr1, foldr', foldr1',
@@ -1255,6 +1255,14 @@ findIndex :: Storable a => (a -> Bool) -> Vector a -> Maybe Int
 {-# INLINE findIndex #-}
 findIndex = G.findIndex
 
+-- | /O(n)/ Yield 'Just' the index of the /last/ element matching the predicate
+-- or 'Nothing' if no such element exists.
+--
+-- Does not fuse.
+findIndexR :: Storable a => (a -> Bool) -> Vector a -> Maybe Int
+{-# INLINE findIndexR #-}
+findIndexR = G.findIndexR
+
 -- | /O(n)/ Yield the indices of elements satisfying the predicate in ascending
 -- order.
 findIndices :: Storable a => (a -> Bool) -> Vector a -> Vector Int

vector/src/Data/Vector/Unboxed.hs

@@ -152,7 +152,7 @@ module Data.Vector.Unboxed (
  partition, unstablePartition, partitionWith, span, break, groupBy, group,
 
  -- ** Searching
- elem, notElem, find, findIndex, findIndices, elemIndex, elemIndices,
+ elem, notElem, find, findIndex, findIndexR, findIndices, elemIndex, elemIndices,
 
  -- * Folding
  foldl, foldl1, foldl', foldl1', foldr, foldr1, foldr', foldr1',
@@ -1244,6 +1244,14 @@ findIndex :: Unbox a => (a -> Bool) -> Vector a -> Maybe Int
 {-# INLINE findIndex #-}
 findIndex = G.findIndex
 
+-- | /O(n)/ Yield 'Just' the index of the /last/ element matching the predicate
+-- or 'Nothing' if no such element exists.
+--
+-- Does not fuse.
+findIndexR :: Unbox a => (a -> Bool) -> Vector a -> Maybe Int
+{-# INLINE findIndexR #-}
+findIndexR = G.findIndexR
+
 -- | /O(n)/ Yield the indices of elements satisfying the predicate in ascending
 -- order.
 findIndices :: Unbox a => (a -> Bool) -> Vector a -> Vector Int