app

Safe Haskell None
Language Haskell2010

Network

Description

Module providing the API using the data from Roads Also contains some hardcoded data, which - contrary to Roads - is not generated.

Synopsis

Documentation

chooseTeamSpots :: Map Team Coord #

The position where to choose the team

deckForEncounter :: Model -> Team -> Nat -> [ID] #

data Encounter #

Possible encounters on the world map

Constructors

Fight Team Kind

Fighting
Reward Nat

Picking up rewards. The Nat indicates the number of rewards.
Select Team

Choosing your team at the start of the game
Instances
Eq Encounter #  
Instance details

Defined in Network

Methods

(==) :: Encounter -> Encounter -> Bool #

(/=) :: Encounter -> Encounter -> Bool #

Show Encounter #  
Instance details

Defined in Network

Methods

showsPrec :: Int -> Encounter -> ShowS #

show :: Encounter -> String #

showList :: [Encounter] -> ShowS #

Generic Encounter #  
Instance details

Defined in Network

Associated Types

type Rep Encounter :: Type -> Type #

Methods

from :: Encounter -> Rep Encounter x #

to :: Rep Encounter x -> Encounter #

type Rep Encounter #  
Instance details

Defined in Network

type Rep Encounter = D1 (MetaData "Encounter" "Network" "main" False) (C1 (MetaCons "Fight" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Team) :*: S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Kind)) :+: (C1 (MetaCons "Reward" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Nat)) :+: C1 (MetaCons "Select" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Team))))

fightSpots :: Map Team [(Coord, Kind)] #

The position of fights, hardcoded yes

journeys :: Map Team [[Encounter]] #

Journeys of playable teams, for testing. This data could be generated automatically, this is tracked in https://github.com/smelc/miso-darkcraw/issues/13

lootNextToFight :: Coord -> Maybe Coord #

lootSpots :: Map Coord Nat #

Map from coordinates to the number of loots at this position

class Network b where #

The high-level API to query data from Roads

Methods

neighbors :: b -> Coord -> [Coord] #

Instances
Network Topology #  
Instance details

Defined in Network

Methods

neighbors :: Topology -> Coord -> [Coord] #

mkTopology :: [(Nat, Nat)] -> Topology #

How to obtain the API from data in Roads

rewards :: Map Team [Rewards] #

data Rewards #

Rewards after a game. First Nat is the number of rewards to pick. Second list is all available rewards.

Constructors

Rewards Nat [ID]  
Instances
Eq Rewards #  
Instance details

Defined in Network

Methods

(==) :: Rewards -> Rewards -> Bool #

(/=) :: Rewards -> Rewards -> Bool #

Show Rewards #  
Instance details

Defined in Network

Methods

showsPrec :: Int -> Rewards -> ShowS #

show :: Rewards -> String #

showList :: [Rewards] -> ShowS #

Generic Rewards #  
Instance details

Defined in Network

Associated Types

type Rep Rewards :: Type -> Type #

Methods

from :: Rewards -> Rep Rewards x #

to :: Rep Rewards x -> Rewards #

type Rep Rewards #  
Instance details

Defined in Network

type Rep Rewards = D1 (MetaData "Rewards" "Network" "main" False) (C1 (MetaCons "Rewards" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Nat) :*: S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [ID])))

data Topology #

Instances
Network Topology #  
Instance details

Defined in Network

Methods

neighbors :: Topology -> Coord -> [Coord] #