mpmc_channel
)Expand description
Multi-producer, multi-consumer FIFO queue communication primitives.
This module provides message-based communication over channels, concretely defined by two types:
Sender
s are used to send data to a set of Receiver
s. Both
sender and receiver are cloneable (multi-producer) such that many threads can send
simultaneously to receivers (multi-consumer).
These channels come in two flavors:
-
An asynchronous, infinitely buffered channel. The
channel
function will return a(Sender, Receiver)
tuple where all sends will be asynchronous (they never block). The channel conceptually has an infinite buffer. -
A synchronous, bounded channel. The
sync_channel
function will return a(SyncSender, Receiver)
tuple where the storage for pending messages is a pre-allocated buffer of a fixed size. All sends will be synchronous by blocking until there is buffer space available. Note that a bound of 0 is allowed, causing the channel to become a “rendezvous” channel where each sender atomically hands off a message to a receiver.
§Disconnection
The send and receive operations on channels will all return a Result
indicating whether the operation succeeded or not. An unsuccessful operation
is normally indicative of the other half of a channel having “hung up” by
being dropped in its corresponding thread.
Once half of a channel has been deallocated, most operations can no longer
continue to make progress, so Err
will be returned. Many applications
will continue to unwrap
the results returned from this module,
instigating a propagation of failure among threads if one unexpectedly dies.
§Examples
Simple usage:
#![feature(mpmc_channel)]
use std::thread;
use std::sync::mpmc::channel;
// Create a simple streaming channel
let (tx, rx) = channel();
thread::spawn(move || {
tx.send(10).unwrap();
});
assert_eq!(rx.recv().unwrap(), 10);
Shared usage:
#![feature(mpmc_channel)]
use std::thread;
use std::sync::mpmc::channel;
thread::scope(|s| {
// Create a shared channel that can be sent along from many threads
// where tx is the sending half (tx for transmission), and rx is the receiving
// half (rx for receiving).
let (tx, rx) = channel();
for i in 0..10 {
let tx = tx.clone();
s.spawn(move || {
tx.send(i).unwrap();
});
}
for _ in 0..5 {
let rx1 = rx.clone();
let rx2 = rx.clone();
s.spawn(move || {
let j = rx1.recv().unwrap();
assert!(0 <= j && j < 10);
});
s.spawn(move || {
let j = rx2.recv().unwrap();
assert!(0 <= j && j < 10);
});
}
})
Propagating panics:
#![feature(mpmc_channel)]
use std::sync::mpmc::channel;
// The call to recv() will return an error because the channel has already
// hung up (or been deallocated)
let (tx, rx) = channel::<i32>();
drop(tx);
assert!(rx.recv().is_err());
Structs§
- Into
Iter Experimental - Iter
Experimental - Receiver
Experimental The receiving half of Rust’schannel
(orsync_channel
) type. Different threads can share thisSender
by cloning it. - Recv
Error Experimental - Send
Error Experimental An error returned from theSender::send
orSyncSender::send
function on channels. - Sender
Experimental The sending-half of Rust’s synchronouschannel
type. - TryIter
Experimental
Enums§
- Recv
Timeout Error Experimental This enumeration is the list of possible errors that maderecv_timeout
unable to return data when called. This can occur with both achannel
and async_channel
. - Send
Timeout Error Experimental An error returned from thesend_timeout
method. - TryRecv
Error Experimental This enumeration is the list of the possible reasons thattry_recv
could not return data when called. This can occur with both achannel
and async_channel
. - TrySend
Error Experimental This enumeration is the list of the possible error outcomes for thetry_send
method.
Functions§
- channel
Experimental Creates a new asynchronous channel, returning the sender/receiver halves. All data sent on theSender
will become available on theReceiver
in the same order as it was sent, and nosend
will block the calling thread (this channel has an “infinite buffer”, unlikesync_channel
, which will block after its buffer limit is reached).recv
will block until a message is available while there is at least oneSender
alive (including clones). - sync_
channel Experimental Creates a new synchronous, bounded channel. All data sent on theSender
will become available on theReceiver
in the same order as it was sent. Like asynchronouschannel
s, theReceiver
will block until a message becomes available.sync_channel
differs greatly in the semantics of the sender, however.