module Game.LambdaHack.Common.PointArray
( Array
, (!), (//), replicateA, replicateMA, generateMA, sizeA
, foldlA, ifoldlA, imapA, minIndexA, minLastIndexA, maxIndexA, maxLastIndexA
) where
import Control.Arrow ((***))
import Control.Monad
import Data.Binary
import Data.Vector.Binary ()
import qualified Data.Vector.Fusion.Stream as Stream
import qualified Data.Vector.Generic as G
import qualified Data.Vector.Unboxed as U
import Game.LambdaHack.Common.Point
data Array c = Array
{ axsize :: X
, aysize :: Y
, avector :: U.Vector Word8
}
deriving Eq
instance Show (Array c) where
show a = "PointArray.Array with size " ++ show (sizeA a)
cnv :: (Enum a, Enum b) => a -> b
cnv = toEnum . fromEnum
pindex :: X -> Point -> Int
pindex xsize (Point x y) = x + y * xsize
punindex :: X -> Int -> Point
punindex xsize n = let (y, x) = n `quotRem` xsize
in Point x y
(!) :: Enum c => Array c -> Point -> c
(!) Array{..} p = cnv $ avector U.! pindex axsize p
(//) :: Enum c => Array c -> [(Point, c)] -> Array c
(//) Array{..} l = let v = avector U.// map (pindex axsize *** cnv) l
in Array{avector = v, ..}
replicateA :: Enum c => X -> Y -> c -> Array c
replicateA axsize aysize c =
Array{avector = U.replicate (axsize * aysize) $ cnv c, ..}
replicateMA :: Enum c => Monad m => X -> Y -> m c -> m (Array c)
replicateMA axsize aysize m = do
v <- U.replicateM (axsize * aysize) $ liftM cnv m
return $! Array{avector = v, ..}
generateMA :: Enum c => Monad m => X -> Y -> (Point -> m c) -> m (Array c)
generateMA axsize aysize fm = do
let gm n = liftM cnv $ fm $ punindex axsize n
v <- U.generateM (axsize * aysize) gm
return $! Array{avector = v, ..}
sizeA :: Array c -> (X, Y)
sizeA Array{..} = (axsize, aysize)
foldlA :: Enum c => (a -> c -> a) -> a -> Array c -> a
foldlA f z0 Array{..} =
U.foldl' (\a c -> f a (cnv c)) z0 avector
ifoldlA :: Enum c => (a -> Point -> c -> a) -> a -> Array c -> a
ifoldlA f z0 Array{..} =
U.ifoldl' (\a n c -> f a (punindex axsize n) (cnv c)) z0 avector
imapA :: (Enum c, Enum d) => (Point -> c -> d) -> Array c -> Array d
imapA f Array{..} =
let v = U.imap (\n c -> cnv $ f (punindex axsize n) (cnv c)) avector
in Array{avector = v, ..}
minIndexA :: Enum c => Array c -> Point
minIndexA Array{..} = punindex axsize $ U.minIndex avector
minLastIndexA :: Enum c => Array c -> Point
minLastIndexA Array{..} =
punindex axsize
$ fst . Stream.foldl1' imin . Stream.indexed . G.stream
$ avector
where
imin (i, x) (j, y) = i `seq` j `seq` if x >= y then (j, y) else (i, x)
maxIndexA :: Enum c => Array c -> Point
maxIndexA Array{..} = punindex axsize $ U.maxIndex avector
maxLastIndexA :: Enum c => Array c -> Point
maxLastIndexA Array{..} =
punindex axsize
$ fst . Stream.foldl1' imax . Stream.indexed . G.stream
$ avector
where
imax (i, x) (j, y) = i `seq` j `seq` if x <= y then (j, y) else (i, x)
instance Binary (Array c) where
put Array{..} = do
put axsize
put aysize
put avector
get = do
axsize <- get
aysize <- get
avector <- get
return $! Array{..}