{-# LANGUAGE CPP #-}
module Data.DynamicArray where
#ifdef BOUNDS_CHECKS
import qualified Data.Primitive.SmallArray.Checked as P
#else
import qualified Data.Primitive.SmallArray as P
#endif
import Control.Monad.ST
import Data.List
class Default a where
def :: a
data Array a =
Array {
arraySize :: {-# UNPACK #-} !Int,
arrayContents :: {-# UNPACK #-} !(P.SmallArray a) }
{-# INLINE toList #-}
toList :: Array a -> [(Int, a)]
toList arr =
[ (i, x)
| i <- [0..arraySize arr-1],
let x = P.indexSmallArray (arrayContents arr) i ]
instance Show a => Show (Array a) where
show arr =
"{" ++
intercalate ", "
[ show i ++ "->" ++ show x
| (i, x) <- toList arr ] ++
"}"
newArray :: Default a => Array a
newArray = runST $ do
marr <- P.newSmallArray 0 def
arr <- P.unsafeFreezeSmallArray marr
return (Array 0 arr)
{-# INLINE (!) #-}
(!) :: Default a => Array a -> Int -> a
arr ! n
| 0 <= n && n < arraySize arr =
P.indexSmallArray (arrayContents arr) n
| otherwise = def
{-# INLINEABLE update #-}
update :: Default a => Int -> a -> Array a -> Array a
update n x arr = runST $ do
let size = arraySize arr `max` (n+1)
marr <- P.newSmallArray size def
P.copySmallArray marr 0 (arrayContents arr) 0 (arraySize arr)
P.writeSmallArray marr n $! x
arr' <- P.unsafeFreezeSmallArray marr
return (Array size arr')