Game.LambdaHack.Common.PointArray

Arrays, based on Data.Vector.Unboxed, indexed by Point.

Documentation

class (Ord c, Eq (UnboxRep c), Ord (UnboxRep c), Bounded (UnboxRep c), Binary (UnboxRep c), Unbox (UnboxRep c)) => UnboxRepClass c where

Minimal complete definition

toUnboxRepUnsafe, fromUnboxRep

Associated Types

type UnboxRep c

Methods

toUnboxRepUnsafe :: c -> UnboxRep c

fromUnboxRep :: UnboxRep c -> c

Instances

UnboxRepClass Bool

Defined in Game.LambdaHack.Common.PointArray

Associated Types

type UnboxRep Bool :: *

Methods

toUnboxRepUnsafe :: Bool -> UnboxRep Bool

fromUnboxRep :: UnboxRep Bool -> Bool

UnboxRepClass Word8

Defined in Game.LambdaHack.Common.PointArray

Associated Types

type UnboxRep Word8 :: *

Methods

toUnboxRepUnsafe :: Word8 -> UnboxRep Word8

fromUnboxRep :: UnboxRep Word8 -> Word8

UnboxRepClass AttrCharW32

Defined in Game.LambdaHack.Common.Color

Associated Types

type UnboxRep AttrCharW32 :: *

Methods

toUnboxRepUnsafe :: AttrCharW32 -> UnboxRep AttrCharW32

fromUnboxRep :: UnboxRep AttrCharW32 -> AttrCharW32

UnboxRepClass BfsDistance

Defined in Game.LambdaHack.Client.Bfs

Associated Types

type UnboxRep BfsDistance :: *

Methods

toUnboxRepUnsafe :: BfsDistance -> UnboxRep BfsDistance

fromUnboxRep :: UnboxRep BfsDistance -> BfsDistance

UnboxRepClass (ContentId k)

Defined in Game.LambdaHack.Common.ContentData

Associated Types

type UnboxRep (ContentId k) :: *

Methods

toUnboxRepUnsafe :: ContentId k -> UnboxRep (ContentId k)

fromUnboxRep :: UnboxRep (ContentId k) -> ContentId k

data Array c

Arrays indexed by Point.

Constructors

Array

Fields

• axsize :: X
• aysize :: Y
• avector :: Vector (UnboxRep c)

Instances

UnboxRepClass c => Eq (Array c)

Defined in Game.LambdaHack.Common.PointArray

Methods

(==) :: Array c -> Array c -> Bool

(/=) :: Array c -> Array c -> Bool

Show (Array c)

Defined in Game.LambdaHack.Common.PointArray

Methods

showsPrec :: Int -> Array c -> ShowS

show :: Array c -> String

showList :: [Array c] -> ShowS

UnboxRepClass c => Binary (Array c)

Defined in Game.LambdaHack.Common.PointArray

Methods

put :: Array c -> Put

get :: Get (Array c)

putList :: [Array c] -> Put

pindex :: X -> Point -> Int

punindex :: X -> Int -> Point

(!) :: UnboxRepClass c => Array c -> Point -> c

Array lookup.

accessI :: UnboxRepClass c => Array c -> Int -> UnboxRep c

(//) :: UnboxRepClass c => Array c -> [(Point, c)] -> Array c

Construct an array updated with the association list.

unsafeUpdateA :: UnboxRepClass c => Array c -> [(Point, c)] -> ()

unsafeWriteA :: UnboxRepClass c => Array c -> Point -> c -> ()

unsafeWriteManyA :: UnboxRepClass c => Array c -> [Point] -> c -> ()

replicateA :: UnboxRepClass c => X -> Y -> c -> Array c

Create an array from a replicated element.

replicateMA :: (Monad m, UnboxRepClass c) => X -> Y -> m c -> m (Array c)

Create an array from a replicated monadic action.

generateA :: UnboxRepClass c => X -> Y -> (Point -> c) -> Array c

Create an array from a function.

generateMA :: (Monad m, UnboxRepClass c) => X -> Y -> (Point -> m c) -> m (Array c)

Create an array from a monadic function.

unfoldrNA :: UnboxRepClass c => X -> Y -> (b -> (c, b)) -> b -> Array c

sizeA :: Array c -> (X, Y)

Content identifiers array size.

foldrA :: UnboxRepClass c => (c -> a -> a) -> a -> Array c -> a

Fold right over an array.

foldrA' :: UnboxRepClass c => (c -> a -> a) -> a -> Array c -> a

Fold right strictly over an array.

foldlA' :: UnboxRepClass c => (a -> c -> a) -> a -> Array c -> a

Fold left strictly over an array.

ifoldrA :: UnboxRepClass c => (Point -> c -> a -> a) -> a -> Array c -> a

Fold right over an array (function applied to each element and its index).

ifoldrA' :: UnboxRepClass c => (Point -> c -> a -> a) -> a -> Array c -> a

Fold right strictly over an array (function applied to each element and its index).

ifoldlA' :: UnboxRepClass c => (a -> Point -> c -> a) -> a -> Array c -> a

Fold left strictly over an array (function applied to each element and its index).

foldMA' :: (Monad m, UnboxRepClass c) => (a -> c -> m a) -> a -> Array c -> m a

Fold monadically strictly over an array.

ifoldMA' :: (Monad m, UnboxRepClass c) => (a -> Point -> c -> m a) -> a -> Array c -> m a

Fold monadically strictly over an array (function applied to each element and its index).

mapA :: (UnboxRepClass c, UnboxRepClass d) => (c -> d) -> Array c -> Array d

Map over an array.

imapA :: (UnboxRepClass c, UnboxRepClass d) => (Point -> c -> d) -> Array c -> Array d

Map over an array (function applied to each element and its index).

imapMA_ :: (Monad m, UnboxRepClass c) => (Point -> c -> m ()) -> Array c -> m ()

Map monadically over an array (function applied to each element and its index) and ignore the results.

safeSetA :: UnboxRepClass c => c -> Array c -> Array c

Set all elements to the given value, in place, if possible.

unsafeSetA :: UnboxRepClass c => c -> Array c -> Array c

Set all elements to the given value, in place.

minIndexA :: UnboxRepClass c => Array c -> Point

Yield the point coordinates of a minimum element of the array. The array may not be empty.

minLastIndexA :: UnboxRepClass c => Array c -> Point

Yield the point coordinates of the last minimum element of the array. The array may not be empty.

minIndexesA :: UnboxRepClass c => Array c -> [Point]

Yield the point coordinates of all the minimum elements of the array. The array may not be empty.

maxIndexA :: UnboxRepClass c => Array c -> Point

Yield the point coordinates of the first maximum element of the array. The array may not be empty.

maxLastIndexA :: UnboxRepClass c => Array c -> Point

Yield the point coordinates of the last maximum element of the array. The array may not be empty.

forceA :: UnboxRepClass c => Array c -> Array c

Force the array not to retain any extra memory.

fromListA :: UnboxRepClass c => X -> Y -> [c] -> Array c

toListA :: UnboxRepClass c => Array c -> [c]

Internal operations

toUnboxRep :: UnboxRepClass c => c -> UnboxRep c