@@ -99,7 +99,7 @@ unsafeThaw (Array cont# arrS arrL) = MArray.Array cont# arrS arrL arrL
99{-# NOINLINE nil #-}
99{-# NOINLINE nil #-}
100nil :: Array a
100nil :: Array a
101nil = unsafePerformIO $ do
101nil = unsafePerformIO $ do
102− marr <- MArray.newArray 0
102+ marr <- MArray.new 0
103 return $ unsafeFreeze marr
103 return $ unsafeFreeze marr
105-------------------------------------------------------------------------------
105-------------------------------------------------------------------------------
@@ -115,7 +115,7 @@ write :: MonadIO m => Fold m a (Array a)
115write = Fold step initial extract
115write = Fold step initial extract
117 initial = do
117 initial = do
118− marr <- liftIO $ MArray.newArray 0
118+ marr <- liftIO $ MArray.new 0
119 return $ FL.Partial (Tuple3' marr 0 0)
119 return $ FL.Partial (Tuple3' marr 0 0)
120 step (Tuple3' marr i capacity) x
120 step (Tuple3' marr i capacity) x
121 | i == capacity =
121 | i == capacity =
@@ -136,7 +136,7 @@ write = Fold step initial extract
136{-# INLINE_NORMAL fromStreamDN #-}
136{-# INLINE_NORMAL fromStreamDN #-}
137fromStreamDN :: MonadIO m => Int -> D.Stream m a -> m (Array a)
137fromStreamDN :: MonadIO m => Int -> D.Stream m a -> m (Array a)
138fromStreamDN limit str = do
138fromStreamDN limit str = do
139− marr <- liftIO $ MArray.newArray (max limit 0)
139+ marr <- liftIO $ MArray.new (max limit 0)
141 D.foldlM'
141 D.foldlM'
142 (\i x -> i `seq` liftIO $ MArray.putIndexUnsafe i x marr >> return (i + 1))
142 (\i x -> i `seq` liftIO $ MArray.putIndexUnsafe i x marr >> return (i + 1))
@@ -263,7 +263,7 @@ writeLastN n
263 return $ FL.Partial $ Tuple' rb (rh + 1)
263 return $ FL.Partial $ Tuple' rb (rh + 1)
265 done (Tuple' rb rh) = do
265 done (Tuple' rb rh) = do
266− arr' <- liftIO $ MArray.newArray (min rh n)
266+ arr' <- liftIO $ MArray.new (min rh n)
267 ref <- liftIO $ readIORef $ RB.ringHead rb
267 ref <- liftIO $ readIORef $ RB.ringHead rb
268 if rh < n
268 if rh < n