Update for STArray changes

Author: garyb

src/Data/Set.purs

@@ -32,7 +32,8 @@ import Control.Monad.Rec.Class (Step(..), tailRecM2)
 import Control.Monad.ST (ST)
 import Control.Monad.ST as ST
 import Data.Array as Array
-import Data.Array.ST (STArray, emptySTArray, pushSTArray, unsafeFreeze)
+import Data.Array.ST (STArray)
+import Data.Array.ST as STArray
 import Data.Eq (class Eq1)
 import Data.Foldable (class Foldable, foldMap, foldl, foldr)
 import Data.List (List)
@@ -158,7 +159,7 @@ properSubset s1 s2 = subset s1 s2 && (s1 /= s2)
 
 -- | The set of elements which are in both the first and second set
 intersection :: forall a. Ord a => Set a -> Set a -> Set a
-intersection s1 s2 = fromFoldable (ST.run (emptySTArray >>= intersect >>= unsafeFreeze))
+intersection s1 s2 = fromFoldable (ST.run (STArray.empty >>= intersect >>= STArray.unsafeFreeze))
   where
   toArray = Array.fromFoldable <<< toList
   ls = toArray s1
@@ -172,7 +173,7 @@ intersection s1 s2 = fromFoldable (ST.run (emptySTArray >>= intersect >>= unsafe
       if l < ll && r < rl
       then case compare (ls `Array.unsafeIndex` l) (rs `Array.unsafeIndex` r) of
         EQ -> do
-          _ <- pushSTArray acc (ls `Array.unsafeIndex` l)
+          _ <- STArray.push (ls `Array.unsafeIndex` l) acc
           pure $ Loop {a: l + 1, b: r + 1}
         LT -> pure $ Loop {a: l + 1, b: r}
         GT -> pure $ Loop {a: l, b: r + 1}