labyrinth-0.4.2.0: A complicated turn-based game

Safe HaskellNone

Labyrinth.Reachability

Documentation

type PositionMap a = Map Position aSource

type Connectivity = PositionMap [Position]Source

type Distribution = PositionMap DoubleSource

type Reachability = PositionMap BoolSource

nextCell :: Position -> Reader Labyrinth PositionSource

reachable :: Position -> Reader Labyrinth [Position]Source

connectivity :: Labyrinth -> ConnectivitySource

insertAppend :: Ord k => k -> v -> Map k [v] -> Map k [v]Source

inverse :: (Ord a, Ord b) => Map a [b] -> Map b [a]Source

foldConcat :: Monoid v => Map k [v] -> Map k vSource

distribute :: (Ord k, Monoid v) => Map k [k] -> Map k v -> Map k vSource

distributeN :: (Ord k, Monoid v) => Int -> Map k [k] -> Map k v -> Map k vSource

distributeU :: (Ord k, Monoid v, Eq v) => Map k [k] -> Map k v -> Map k vSource

normalize :: Fractional v => Map k v -> Map k vSource

converge :: Int -> Labyrinth -> DistributionSource

reachConverge :: Int -> Labyrinth -> ReachabilitySource

reachConvergeU :: Labyrinth -> ReachabilitySource

uniformBetween :: a -> [Position] -> PositionMap aSource

armoriesDist :: Labyrinth -> PositionMap AnySource

maxKeyBy :: Ord n => (k -> n) -> Map k a -> nSource

showReach :: Reachability -> StringSource

showDist :: Distribution -> StringSource

showGrid :: (Maybe a -> String) -> PositionMap a -> StringSource

showGridLine :: (Maybe a -> String) -> PositionMap a -> Int -> StringSource

showGridPos :: (Maybe a -> String) -> PositionMap a -> Int -> Int -> StringSource

pad :: Int -> a -> [a] -> [a]Source