Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Synopsis
- data InformationChannel a m = InformationChannel {
- readMessage ∷ STM m a
- writeMessage ∷ a → STM m ()
- type InboundGovernorInfoChannel (muxMode ∷ MuxMode) initiatorCtx peerAddr versionData bytes m a b = InformationChannel (NewConnectionInfo peerAddr (Handle muxMode initiatorCtx (ResponderContext peerAddr) versionData bytes m a b)) m
- type OutboundGovernorInfoChannel peerAddr m = InformationChannel (peerAddr, PeerSharing) m
- newInformationChannel ∷ ∀ a m. MonadLabelledSTM m ⇒ m (InformationChannel a m)
- cc_QUEUE_BOUND ∷ Natural
Documentation
data InformationChannel a m Source #
Information channel.
InformationChannel | |
|
type InboundGovernorInfoChannel (muxMode ∷ MuxMode) initiatorCtx peerAddr versionData bytes m a b = InformationChannel (NewConnectionInfo peerAddr (Handle muxMode initiatorCtx (ResponderContext peerAddr) versionData bytes m a b)) m Source #
type OutboundGovernorInfoChannel peerAddr m = InformationChannel (peerAddr, PeerSharing) m Source #
Control Channel between Server and Outbound Governor.
Control channel that is meant to share inbound connections with the Peer Selection Governor. So the consumer is the Governor and Producer is the Server.
newInformationChannel ∷ ∀ a m. MonadLabelledSTM m ⇒ m (InformationChannel a m) Source #
cc_QUEUE_BOUND ∷ Natural Source #
The InformationChannel
s TBQueue
depth.