Rename unsafe traversals (#137)

Rename unsafe traversals

Author: andrewthad

Data/Primitive/Array.hs

@@ -24,7 +24,7 @@ module Data.Primitive.Array (
   sizeofArray, sizeofMutableArray,
   fromListN, fromList,
   mapArray',
-  unsafeTraverseArray
+  traverseArrayP
 ) where
 
 import Control.Monad.Primitive
@@ -521,9 +521,9 @@ traverseArray f = \ !ary ->
 
 {-# RULES
 "traverse/ST" forall (f :: a -> ST s b). traverseArray f =
-   unsafeTraverseArray f
+   traverseArrayP f
 "traverse/IO" forall (f :: a -> IO b). traverseArray f =
-   unsafeTraverseArray f
+   traverseArrayP f
  #-}
 #if MIN_VERSION_base(4,8,0)
 {-# RULES
@@ -538,12 +538,12 @@ traverseArray f = \ !ary ->
 -- "affine" 'PrimMonad' instance. In particular, it must only produce
 -- *one* result array. 'Control.Monad.Trans.List.ListT'-transformed
 -- monads, for example, will not work right at all.
-unsafeTraverseArray
+traverseArrayP
   :: PrimMonad m
   => (a -> m b)
   -> Array a
   -> m (Array b)
-unsafeTraverseArray f = \ !ary ->
+traverseArrayP f = \ !ary ->
   let
     !sz = sizeofArray ary
     go !i !mary
@@ -558,7 +558,7 @@ unsafeTraverseArray f = \ !ary ->
   in do
     mary <- newArray sz badTraverseValue
     go 0 mary
-{-# INLINE unsafeTraverseArray #-}
+{-# INLINE traverseArrayP #-}
 
 -- | Strict map over the elements of the array.
 mapArray' :: (a -> b) -> Array a -> Array b

Data/Primitive/SmallArray.hs

@@ -58,7 +58,7 @@ module Data.Primitive.SmallArray
   , smallArrayFromList
   , smallArrayFromListN
   , mapSmallArray'
-  , unsafeTraverseSmallArray
+  , traverseSmallArrayP
   ) where
 
 
@@ -411,13 +411,13 @@ sizeofSmallMutableArray (SmallMutableArray ma) = sizeofMutableArray ma
 -- "affine" 'PrimMonad' instance. In particular, it must only produce
 -- *one* result array. 'Control.Monad.Trans.List.ListT'-transformed
 -- monads, for example, will not work right at all.
-unsafeTraverseSmallArray
+traverseSmallArrayP
   :: PrimMonad m
   => (a -> m b)
   -> SmallArray a
   -> m (SmallArray b)
 #if HAVE_SMALL_ARRAY
-unsafeTraverseSmallArray f = \ !ary ->
+traverseSmallArrayP f = \ !ary ->
   let
     !sz = sizeofSmallArray ary
     go !i !mary
@@ -433,9 +433,9 @@ unsafeTraverseSmallArray f = \ !ary ->
     mary <- newSmallArray sz badTraverseValue
     go 0 mary
 #else
-unsafeTraverseSmallArray f (SmallArray ar) = SmallArray `liftM` unsafeTraverseArray f ar
+traverseSmallArrayP f (SmallArray ar) = SmallArray `liftM` traverseArrayP f ar
 #endif
-{-# INLINE unsafeTraverseSmallArray #-}
+{-# INLINE traverseSmallArrayP #-}
 
 -- | Strict map over the elements of the array.
 mapSmallArray' :: (a -> b) -> SmallArray a -> SmallArray b
@@ -698,8 +698,8 @@ traverseSmallArray f = \ !ary ->
 {-# INLINE [1] traverseSmallArray #-}
 
 {-# RULES
-"traverse/ST" forall (f :: a -> ST s b). traverseSmallArray f = unsafeTraverseSmallArray f
-"traverse/IO" forall (f :: a -> IO b). traverseSmallArray f = unsafeTraverseSmallArray f
+"traverse/ST" forall (f :: a -> ST s b). traverseSmallArray f = traverseSmallArrayP f
+"traverse/IO" forall (f :: a -> IO b). traverseSmallArray f = traverseSmallArrayP f
 "traverse/Id" forall (f :: a -> Identity b). traverseSmallArray f =
    (coerce :: (SmallArray a -> SmallArray (Identity b))
            -> SmallArray a -> Identity (SmallArray b)) (fmap f)