Safe Haskell	None
Language	Haskell2010

Game.LambdaHack.Common.Level

Contents

Dungeon
The Level type and its components
Component updates
Level query
Internal operations

Description

Inhabited dungeon levels and the operations to query and change them as the game progresses.

Synopsis

data LevelId
type Dungeon = EnumMap LevelId Level
ascendInBranch :: Dungeon -> Bool -> LevelId -> [LevelId]
whereTo :: LevelId -> Point -> Maybe Bool -> Dungeon -> (LevelId, Point)
type ItemFloor = EnumMap Point ItemBag
type ActorMap = EnumMap Point [ActorId]
type TileMap = Array (ContentId TileKind)
type SmellMap = EnumMap Point Time
data Level = Level {
- lkind :: ContentId CaveKind
- ldepth :: AbsDepth
- lfloor :: ItemFloor
- lembed :: ItemFloor
- lactor :: ActorMap
- ltile :: TileMap
- lxsize :: X
- lysize :: Y
- lsmell :: SmellMap
- lstair :: ([Point], [Point])
- lescape :: [Point]
- lseen :: Int
- lexpl :: Int
- ltime :: Time
- lnight :: Bool
}
updateFloor :: (ItemFloor -> ItemFloor) -> Level -> Level
updateEmbed :: (ItemFloor -> ItemFloor) -> Level -> Level
updateActorMap :: (ActorMap -> ActorMap) -> Level -> Level
updateTile :: (TileMap -> TileMap) -> Level -> Level
updateSmell :: (SmellMap -> SmellMap) -> Level -> Level
at :: Level -> Point -> ContentId TileKind
findPoint :: X -> Y -> (Point -> Maybe Point) -> Rnd Point
findPos :: TileMap -> (Point -> ContentId TileKind -> Bool) -> Rnd Point
findPosTry :: Int -> TileMap -> (Point -> ContentId TileKind -> Bool) -> [Point -> ContentId TileKind -> Bool] -> Rnd Point
findPosTry2 :: Int -> TileMap -> (Point -> ContentId TileKind -> Bool) -> [Point -> ContentId TileKind -> Bool] -> (Point -> ContentId TileKind -> Bool) -> [Point -> ContentId TileKind -> Bool] -> Rnd Point
assertSparseItems :: ItemFloor -> ItemFloor
assertSparseActors :: ActorMap -> ActorMap

Dungeon

data LevelId #

Abstract level identifiers.

Instances

Enum LevelId #
Instance details Defined in Game.LambdaHack.Common.Misc Methods succ :: LevelId -> LevelId # pred :: LevelId -> LevelId # toEnum :: Int -> LevelId # fromEnum :: LevelId -> Int # enumFrom :: LevelId -> [LevelId] # enumFromThen :: LevelId -> LevelId -> [LevelId] # enumFromTo :: LevelId -> LevelId -> [LevelId] # enumFromThenTo :: LevelId -> LevelId -> LevelId -> [LevelId] #
Eq LevelId #
Instance details Defined in Game.LambdaHack.Common.Misc Methods (==) :: LevelId -> LevelId -> Bool # (/=) :: LevelId -> LevelId -> Bool #
Ord LevelId #
Instance details Defined in Game.LambdaHack.Common.Misc Methods compare :: LevelId -> LevelId -> Ordering # (<) :: LevelId -> LevelId -> Bool # (<=) :: LevelId -> LevelId -> Bool # (>) :: LevelId -> LevelId -> Bool # (>=) :: LevelId -> LevelId -> Bool # max :: LevelId -> LevelId -> LevelId # min :: LevelId -> LevelId -> LevelId #
Show LevelId #
Instance details Defined in Game.LambdaHack.Common.Misc Methods showsPrec :: Int -> LevelId -> ShowS # show :: LevelId -> String # showList :: [LevelId] -> ShowS #
Binary LevelId #
Instance details Defined in Game.LambdaHack.Common.Misc Methods put :: LevelId -> Put # get :: Get LevelId # putList :: [LevelId] -> Put #
Hashable LevelId #
Instance details Defined in Game.LambdaHack.Common.Misc Methods hashWithSalt :: Int -> LevelId -> Int # hash :: LevelId -> Int #

type Dungeon = EnumMap LevelId Level #

The complete dungeon is a map from level identifiers to levels.

ascendInBranch :: Dungeon -> Bool -> LevelId -> [LevelId] #

Levels in the current branch, one level up (or down) from the current.

whereTo #

Arguments

:: LevelId	level of the stairs
-> Point	position of the stairs
-> Maybe Bool	optional forced direction
-> Dungeon	current game dungeon
-> (LevelId, Point)	destination level and the pos of its receiving stairs

Compute the level identifier and stair position on the new level, after a level change.

We assume there is never a staircase up and down at the same position.

The `Level` type and its components

type ItemFloor = EnumMap Point ItemBag #

Items located on map tiles.

type ActorMap = EnumMap Point [ActorId] #

Items located on map tiles.

type TileMap = Array (ContentId TileKind) #

Tile kinds on the map.

type SmellMap = EnumMap Point Time #

Current smell on map tiles.

data Level #

A view on single, inhabited dungeon level. Remembered fields carry a subset of the info in the client copies of levels.

Constructors

Level

Fields

lkind :: ContentId CaveKind
the kind of cave the level is an instance of
ldepth :: AbsDepth
absolute depth of the level
lfloor :: ItemFloor
remembered items lying on the floor
lembed :: ItemFloor
remembered items embedded in the tile
lactor :: ActorMap
seen actors at positions on the level; could be recomputed at resume, but small enough
ltile :: TileMap
remembered level map
lxsize :: X
width of the level
lysize :: Y
height of the level
lsmell :: SmellMap
remembered smells on the level
lstair :: ([Point], [Point])
positions of (up, down) stairs
lescape :: [Point]
positions of IK.Escape tiles
lseen :: Int
currently remembered clear tiles
lexpl :: Int
total number of explorable tiles
ltime :: Time
local time on the level (possibly frozen)
lnight :: Bool
whether the level is covered in darkness

Instances

Eq Level #
Instance details Defined in Game.LambdaHack.Common.Level Methods (==) :: Level -> Level -> Bool # (/=) :: Level -> Level -> Bool #
Show Level #
Instance details Defined in Game.LambdaHack.Common.Level Methods showsPrec :: Int -> Level -> ShowS # show :: Level -> String # showList :: [Level] -> ShowS #
Binary Level #
Instance details Defined in Game.LambdaHack.Common.Level Methods put :: Level -> Put # get :: Get Level # putList :: [Level] -> Put #

Component updates

updateFloor :: (ItemFloor -> ItemFloor) -> Level -> Level #

updateEmbed :: (ItemFloor -> ItemFloor) -> Level -> Level #

updateActorMap :: (ActorMap -> ActorMap) -> Level -> Level #

updateTile :: (TileMap -> TileMap) -> Level -> Level #

updateSmell :: (SmellMap -> SmellMap) -> Level -> Level #

Level query

at :: Level -> Point -> ContentId TileKind #

Query for tile kinds on the map.

findPoint :: X -> Y -> (Point -> Maybe Point) -> Rnd Point #

Find a random position on the map satisfying a predicate.

findPos :: TileMap -> (Point -> ContentId TileKind -> Bool) -> Rnd Point #

Find a random position on the map satisfying a predicate.

findPosTry #

Arguments

:: Int	the number of tries
-> TileMap	look up in this map
-> (Point -> ContentId TileKind -> Bool)	mandatory predicate
-> [Point -> ContentId TileKind -> Bool]	optional predicates
-> Rnd Point

Try to find a random position on the map satisfying conjunction of the mandatory and an optional predicate. If the permitted number of attempts is not enough, try again the same number of times without the next optional predicate, and fall back to trying as many times, as needed, with only the mandatory predicate.

findPosTry2 #

Arguments

:: Int	the number of tries
-> TileMap	look up in this map
-> (Point -> ContentId TileKind -> Bool)	mandatory predicate
-> [Point -> ContentId TileKind -> Bool]	optional predicates
-> (Point -> ContentId TileKind -> Bool)	good to have pred.
-> [Point -> ContentId TileKind -> Bool]	worst case predicates
-> Rnd Point

Internal operations

assertSparseItems :: ItemFloor -> ItemFloor #

assertSparseActors :: ActorMap -> ActorMap #

Dungeon

The Level type and its components

Component updates

Level query

Internal operations

The `Level` type and its components