| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Test.Consensus.PointSchedule.Peers
Description
This module contains the definition of point schedule _peers_ as well as all kind of utilities to manipulate them.
Synopsis
- data Peer a = Peer {}
- data PeerId
- data Peers a = Peers {
- honestPeers ∷ Map Int a
- adversarialPeers ∷ Map Int a
- adversarialPeers' ∷ Peers a → Map PeerId a
- adversarialPeers'' ∷ Peers a → Map PeerId (Peer a)
- deletePeer ∷ PeerId → Peers a → Peers a
- enumerateAdversaries ∷ [PeerId]
- fromMap ∷ Map PeerId (Peer a) → Peers a
- fromMap' ∷ Map PeerId a → Peers a
- getPeer ∷ PeerId → Peers a → Peer a
- getPeerIds ∷ Peers a → [PeerId]
- honestPeers' ∷ Peers a → Map PeerId a
- honestPeers'' ∷ Peers a → Map PeerId (Peer a)
- isAdversarialPeerId ∷ PeerId → Bool
- isHonestPeerId ∷ PeerId → Bool
- peers' ∷ [a] → [a] → Peers a
- peersFromPeerIdList ∷ [PeerId] → a → Peers a
- peersFromPeerIdList' ∷ [PeerId] → Peers ()
- peersFromPeerList ∷ [Peer a] → Peers a
- peersList ∷ Peers a → [Peer a]
- peersOnlyAdversary ∷ a → Peers a
- peersOnlyHonest ∷ a → Peers a
- toMap ∷ Peers a → Map PeerId (Peer a)
- toMap' ∷ Peers a → Map PeerId a
- unionWithKey ∷ (PeerId → a → a → a) → Peers a → Peers a → Peers a
- updatePeer ∷ (a → (a, b)) → PeerId → Peers a → (Peers a, b)
Documentation
General-purpose functor associated with a peer.
Instances
| Functor Peer Source # | |
| Foldable Peer Source # | |
Defined in Test.Consensus.PointSchedule.Peers Methods fold ∷ Monoid m ⇒ Peer m → m # foldMap ∷ Monoid m ⇒ (a → m) → Peer a → m # foldMap' ∷ Monoid m ⇒ (a → m) → Peer a → m # foldr ∷ (a → b → b) → b → Peer a → b # foldr' ∷ (a → b → b) → b → Peer a → b # foldl ∷ (b → a → b) → b → Peer a → b # foldl' ∷ (b → a → b) → b → Peer a → b # foldr1 ∷ (a → a → a) → Peer a → a # foldl1 ∷ (a → a → a) → Peer a → a # elem ∷ Eq a ⇒ a → Peer a → Bool # maximum ∷ Ord a ⇒ Peer a → a # | |
| Traversable Peer Source # | |
| Eq a ⇒ Eq (Peer a) Source # | |
| Show a ⇒ Show (Peer a) Source # | |
| Condense a ⇒ Condense (Peer a) Source # | |
| CondenseList a ⇒ CondenseList (Peer a) Source # | |
Defined in Test.Consensus.PointSchedule.Peers Methods condenseList ∷ [Peer a] → [String] Source # | |
Identifier used to index maps and specify which peer is active during a tick.
Constructors
| HonestPeer Int | |
| AdversarialPeer Int |
Instances
General-purpose functor for a set of peers.
Constructors
| Peers | |
Fields
| |
Instances
| Functor Peers Source # | |
| Foldable Peers Source # | |
Defined in Test.Consensus.PointSchedule.Peers Methods fold ∷ Monoid m ⇒ Peers m → m # foldMap ∷ Monoid m ⇒ (a → m) → Peers a → m # foldMap' ∷ Monoid m ⇒ (a → m) → Peers a → m # foldr ∷ (a → b → b) → b → Peers a → b # foldr' ∷ (a → b → b) → b → Peers a → b # foldl ∷ (b → a → b) → b → Peers a → b # foldl' ∷ (b → a → b) → b → Peers a → b # foldr1 ∷ (a → a → a) → Peers a → a # foldl1 ∷ (a → a → a) → Peers a → a # elem ∷ Eq a ⇒ a → Peers a → Bool # maximum ∷ Ord a ⇒ Peers a → a # | |
| Eq a ⇒ Eq (Peers a) Source # | |
| Show a ⇒ Show (Peers a) Source # | |
adversarialPeers' ∷ Peers a → Map PeerId a Source #
Variant of adversarialPeers that returns a map with PeerIds as keys.
adversarialPeers'' ∷ Peers a → Map PeerId (Peer a) Source #
Variant of adversarialPeers that returns a map with PeerIds as keys and
values as Peers.
honestPeers' ∷ Peers a → Map PeerId a Source #
Variant of honestPeers that returns a map with PeerIds as keys.
honestPeers'' ∷ Peers a → Map PeerId (Peer a) Source #
Variant of honestPeers that returns a map with PeerIds as keys and
values as Peers.
isHonestPeerId ∷ PeerId → Bool Source #
peers' ∷ [a] → [a] → Peers a Source #
Construct Peers from values, adding adversary names based on the default schema.
peersFromPeerIdList ∷ [PeerId] → a → Peers a Source #
Make a Peers structure from a list of peer ids and a default value.
peersFromPeerIdList' ∷ [PeerId] → Peers () Source #
Like peersFromPeerIdList with ().
peersOnlyAdversary ∷ a → Peers a Source #
peersOnlyHonest ∷ a → Peers a Source #
A set of peers with only one honest peer carrying the given value.