Safe Haskell	Safe-Inferred
Language	Haskell2010

Test.Util.Schedule

Description

Utilities to schedule actions per Tick.

Synopsis

newtype Schedule a = Schedule {
- getSchedule ∷ Map Tick [a]
}
genSchedule ∷ [a] → Gen (Schedule a)
joinSchedule ∷ Schedule a → [a]
lastTick ∷ Schedule a → Tick
shrinkSchedule ∷ Schedule a → [Schedule a]

Documentation

newtype Schedule a Source #

A schedule plans actions on certain times.

TODO Note that a schedule can't express delays between the actions within a single tick. Generating such delays may expose more (most likely concurrency-related) bugs.

Constructors

Schedule
Fields getSchedule ∷ Map Tick [a]

Instances

Instances details

Show a ⇒ Show (Schedule a) Source #
Instance details Defined in Test.Util.Schedule Methods showsPrec ∷ Int → Schedule a → ShowS # show ∷ Schedule a → String # showList ∷ [Schedule a] → ShowS #
Eq a ⇒ Eq (Schedule a) Source #
Instance details Defined in Test.Util.Schedule Methods (==) ∷ Schedule a → Schedule a → Bool # (/=) ∷ Schedule a → Schedule a → Bool #
Condense a ⇒ Condense (Schedule a) Source #
Instance details Defined in Test.Util.Schedule Methods condense ∷ Schedule a → String Source #

genSchedule ∷ [a] → Gen (Schedule a) Source #

Spread out elements over a schedule, i.e. schedule a number of elements to be processed on each tick. Most ticks will have no associated elements.

joinSchedule ∷ Schedule a → [a] Source #

Inverse of genSchedule

lastTick ∷ Schedule a → Tick Source #

Return the last tick at which an update is planned, if no updates are planned, return 0.

shrinkSchedule ∷ Schedule a → [Schedule a] Source #

Repeatedly remove the last entry (highest Tick)