Game.LambdaHack.Common.Level

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

Dungeon

type Dungeon = EnumMap LevelId Level

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

dungeonBounds :: Dungeon -> (LevelId, LevelId)

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

-> Bool

optional forced direction

-> Dungeon

current game dungeon

-> [(LevelId, Point)]

possible destinations

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 BigActorMap = EnumMap Point ActorId

Big actors located on map tiles.

type ProjectileMap = EnumMap Point [ActorId]

Collections of projectiles 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

• lbig :: BigActorMap

  seen big (non-projectile) actors at positions on the level; could be recomputed at resume, but small enough

• lproj :: ProjectileMap

  seen projectiles at positions on the level; could be recomputed at resume

• ltile :: TileMap

  remembered level map

• lentry :: EntryMap

  room entrances on the level

• larea :: Area

  area 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

Defined in Game.LambdaHack.Common.Level

Methods

(==) :: Level -> Level -> Bool

(/=) :: Level -> Level -> Bool

Show Level

Defined in Game.LambdaHack.Common.Level

Methods

showsPrec :: Int -> Level -> ShowS

show :: Level -> String

showList :: [Level] -> ShowS

Binary Level

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

updateBigMap :: (BigActorMap -> BigActorMap) -> Level -> Level

updateProjMap :: (ProjectileMap -> ProjectileMap) -> Level -> Level

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

updateEntry :: (EntryMap -> EntryMap) -> Level -> Level

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

Level query

at :: Level -> Point -> ContentId TileKind

Query for tile kinds on the map.

posToBigLvl :: Point -> Level -> Maybe ActorId

occupiedBigLvl :: Point -> Level -> Bool

posToProjsLvl :: Point -> Level -> [ActorId]

occupiedProjLvl :: Point -> Level -> Bool

posToAidsLvl :: Point -> Level -> [ActorId]

findPosTry

Arguments

:: Int

the number of tries

-> Level

look up in this level

-> (Point -> ContentId TileKind -> Bool)

mandatory predicate

-> [Point -> ContentId TileKind -> Bool]

optional predicates

-> Rnd (Maybe 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 with only the mandatory predicate.

findPosTry2

Arguments

:: Int

the number of tries

-> Level

look up in this level

-> (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 (Maybe Point)

nearbyPassablePoints :: COps -> Level -> Point -> [Point]

Generate a list of all passable points on (connected component of) the level in the order of path distance from the starting position (BFS). The starting position needn't be passable and is always included.

nearbyFreePoints :: COps -> Level -> (ContentId TileKind -> Bool) -> Point -> [Point]

Misc

sortEmbeds :: COps -> ContentId TileKind -> [(ItemKind, (ItemId, ItemQuant))] -> [(ItemId, ItemQuant)]

Internal operations

type EntryMap = EnumMap Point PlaceEntry

Entries of places on the map.

assertSparseItems :: ItemFloor -> ItemFloor

assertSparseProjectiles :: ProjectileMap -> ProjectileMap