Channels preview

Informative guide. This Book page explains Beskid but does not define the standard. For normative requirements, use the Beskid Standard.

If two fibers need to talk, they use a channel. They do not share a mutable stack and hope for the best: that pattern already has a body count in other languages.

Model

• Channel<T> carries typed messages between fibers.
• Send / Receive operations block cooperatively (scheduler-aware).
• Errors and cancellation surface through Result on join/receive paths per Concurrency package.

sequenceDiagram
  accTitle: Channel send and receive between two fibers
  accDescr: Fiber B receives from a channel and waits cooperatively until Fiber A sends a value, then continues with that value.
  participant A as Fiber A
  participant C as Channel of T
  participant B as Fiber B
  B->>C: Receive
  Note over B,C: B waits cooperatively while the channel is empty
  A->>C: Send value
  C-->>B: value

Text equivalent: Fiber B calls Receive and waits cooperatively. When Fiber A sends a value, the channel hands it to Fiber B.

ADR-backed choices

Cross-fiber events use channels, not ad-hoc flags. See ADR: cross-fiber events use channels.

Mutex and WaitGroup

Mutex and WaitGroup coordinate invariants; they are not a substitute for channel payload transfer. If you are passing data, use a channel; if you are guarding a critical section, use the primitives the spec names.

Memory interaction

Shared heap objects still follow Memory and references; channels are how you avoid data races without pretending Beskid is C++.

Next

Corelib concurrency