Game.GoreAndAsh.Actor.Collection

Documentation

dynCollection

Arguments

:: (ActorMonad m, Eq i, DynCollection c, FilterConstraint c (GameWireIndexed m i a b), FilterConstraint c (Either () b), Foldable c2)

=> c (GameActor m i a b)

Inital set of wires

-> GameWire m (a, Event (c (GameActor m i a b)), Event (c2 i)) (c b)

Makes dynamic collection of wires.

• First input of wire is input for each inner wire.
• Second input is event for adding several wires to collection.
• Third input is event for removing several wires from collection.
• Wire returns list of outputs of inner wires.

Note: if ihibits one of the wires, it is removed from output result during its inhibition

dDynCollection

Arguments

:: (ActorMonad m, Eq i, DynCollection c, FilterConstraint c (GameWireIndexed m i a b), FilterConstraint c (Either () b), Foldable c2)

=> c (GameActor m i a b)

Inital set of wires

-> GameWire m (a, Event (c (GameActor m i a b)), Event (c2 i)) (c b)

Makes dynamic collection of wires.

• First input of wire is input for each inner wire.
• Second input is event for adding several wires to collection.
• Third input is event for removing several wires from collection.
• Wire returns list of outputs of inner wires.

Note: it is delayed version of dynCollection, removing and adding of agents performs on next step after current.

Note: if ihibits one of the wires, it is removed from output result while it inhibits.

class (Filterable c, Foldable c, Functor c, Traversable c) => DynCollection c where

Dynamic collection for control wire that automates handling collections of FRP actors. The class defines minimum set of actions that collection should support to be used as base for collection of actors.

Minimal complete definition

concatDynColl, unzipDynColl, zipDynColl, emptyDynColl, consDynColl

Associated Types

type DynConsConstr c o :: Constraint

Instance specific constraint for appending function

Methods

concatDynColl :: c a -> c a -> c a

Concat of two collections

unzipDynColl :: c (a, b) -> (c a, c b)

Unzipping of collection

zipDynColl :: c a -> c b -> c (a, b)

Ziping collection

emptyDynColl :: c a

Getting empty collection

consDynColl :: DynConsConstr c a => a -> c a -> c a

Adding element to the begining of collection

Instances

DynCollection []

Associated Types

type DynConsConstr ([] :: * -> *) o :: Constraint

Methods

concatDynColl :: [a] -> [a] -> [a]

unzipDynColl :: [(a, b)] -> ([a], [b])

zipDynColl :: [a] -> [b] -> [(a, b)]

emptyDynColl :: [a]

consDynColl :: DynConsConstr [] a => a -> [a] -> [a]

DynCollection Seq

Associated Types

type DynConsConstr (Seq :: * -> *) o :: Constraint

Methods

concatDynColl :: Seq a -> Seq a -> Seq a

unzipDynColl :: Seq (a, b) -> (Seq a, Seq b)

zipDynColl :: Seq a -> Seq b -> Seq (a, b)

emptyDynColl :: Seq a

consDynColl :: DynConsConstr Seq a => a -> Seq a -> Seq a

(Eq k, Hashable k) => DynCollection (HashMap k)

Order of elements is not preserved

Associated Types

type DynConsConstr (HashMap k :: * -> *) o :: Constraint

Methods

concatDynColl :: HashMap k a -> HashMap k a -> HashMap k a

unzipDynColl :: HashMap k (a, b) -> (HashMap k a, HashMap k b)

zipDynColl :: HashMap k a -> HashMap k b -> HashMap k (a, b)

emptyDynColl :: HashMap k a

consDynColl :: DynConsConstr (HashMap k) a => a -> HashMap k a -> HashMap k a