Struct Receiver
pub struct Receiver<T> { /* private fields */ }
dep_flume
only.Expand description
The receiving end of a channel.
Note: Cloning the receiver does not turn this channel into a broadcast channel. Each message will only be received by a single receiver. This is useful for implementing work stealing for concurrent programs.
Implementations§
§impl<T> Receiver<T>
impl<T> Receiver<T>
pub fn try_recv(&self) -> Result<T, TryRecvError> ⓘ
pub fn try_recv(&self) -> Result<T, TryRecvError> ⓘ
Attempt to fetch an incoming value from the channel associated with this receiver, returning an error if the channel is empty or if all senders have been dropped.
pub fn recv(&self) -> Result<T, RecvError> ⓘ
pub fn recv(&self) -> Result<T, RecvError> ⓘ
Wait for an incoming value from the channel associated with this receiver, returning an error if all senders have been dropped.
pub fn recv_deadline(&self, deadline: Instant) -> Result<T, RecvTimeoutError> ⓘ
pub fn recv_deadline(&self, deadline: Instant) -> Result<T, RecvTimeoutError> ⓘ
Wait for an incoming value from the channel associated with this receiver, returning an error if all senders have been dropped or the deadline has passed.
pub fn recv_timeout(&self, dur: Duration) -> Result<T, RecvTimeoutError> ⓘ
pub fn recv_timeout(&self, dur: Duration) -> Result<T, RecvTimeoutError> ⓘ
Wait for an incoming value from the channel associated with this receiver, returning an error if all senders have been dropped or the timeout has expired.
pub fn iter(&self) -> Iter<'_, T> ⓘ
pub fn iter(&self) -> Iter<'_, T> ⓘ
Create a blocking iterator over the values received on the channel that finishes iteration when all senders have been dropped.
You can also create a self-owned iterator with Receiver::into_iter
.
pub fn try_iter(&self) -> TryIter<'_, T> ⓘ
pub fn try_iter(&self) -> TryIter<'_, T> ⓘ
A non-blocking iterator over the values received on the channel that finishes iteration when all senders have been dropped or the channel is empty.
pub fn drain(&self) -> Drain<'_, T> ⓘ
pub fn drain(&self) -> Drain<'_, T> ⓘ
Take all msgs currently sitting in the channel and produce an iterator over them. Unlike
try_iter
, the iterator will not attempt to fetch any more values from the channel once
the function has been called.
pub fn is_disconnected(&self) -> bool
pub fn is_disconnected(&self) -> bool
Returns true if all senders for this channel have been dropped.
pub fn is_empty(&self) -> bool
pub fn is_empty(&self) -> bool
Returns true if the channel is empty. Note: Zero-capacity channels are always empty.
pub fn is_full(&self) -> bool
pub fn is_full(&self) -> bool
Returns true if the channel is full. Note: Zero-capacity channels are always full.
pub fn sender_count(&self) -> usize
pub fn sender_count(&self) -> usize
Get the number of senders that currently exist.
pub fn receiver_count(&self) -> usize
pub fn receiver_count(&self) -> usize
Get the number of receivers that currently exist, including this one.
pub fn same_channel(&self, other: &Receiver<T>) -> bool
pub fn same_channel(&self, other: &Receiver<T>) -> bool
Returns whether the receivers are belong to the same channel.
Trait Implementations§
§impl<T> Clone for Receiver<T>
impl<T> Clone for Receiver<T>
§fn clone(&self) -> Receiver<T>
fn clone(&self) -> Receiver<T>
Clone this receiver. Receiver
acts as a handle to the ending a channel. Remaining
channel contents will only be cleaned up when all senders and the receiver have been
dropped.
Note: Cloning the receiver does not turn this channel into a broadcast channel. Each message will only be received by a single receiver. This is useful for implementing work stealing for concurrent programs.
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read more§impl<'a, T> IntoIterator for &'a Receiver<T>
This exists as a shorthand for Receiver::iter
.
impl<'a, T> IntoIterator for &'a Receiver<T>
This exists as a shorthand for Receiver::iter
.
§impl<T> IntoIterator for Receiver<T>
impl<T> IntoIterator for Receiver<T>
Auto Trait Implementations§
impl<T> Freeze for Receiver<T>
impl<T> RefUnwindSafe for Receiver<T>
impl<T> Send for Receiver<T>where
T: Send,
impl<T> Sync for Receiver<T>where
T: Send,
impl<T> Unpin for Receiver<T>
impl<T> UnwindSafe for Receiver<T>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> ByteSized for T
impl<T> ByteSized for T
Source§const BYTE_ALIGN: usize = _
const BYTE_ALIGN: usize = _
Source§fn byte_align(&self) -> usize
fn byte_align(&self) -> usize
Source§fn ptr_size_ratio(&self) -> [usize; 2]
fn ptr_size_ratio(&self) -> [usize; 2]
Source§impl<T, R> Chain<R> for Twhere
T: ?Sized,
impl<T, R> Chain<R> for Twhere
T: ?Sized,
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> ExtAny for T
impl<T> ExtAny for T
Source§fn type_hash_with<H: Hasher>(&self, hasher: H) -> u64
fn type_hash_with<H: Hasher>(&self, hasher: H) -> u64
TypeId
of Self
using a custom hasher.Source§fn as_any_mut(&mut self) -> &mut dyn Anywhere
Self: Sized,
fn as_any_mut(&mut self) -> &mut dyn Anywhere
Self: Sized,
Source§impl<T> ExtMem for Twhere
T: ?Sized,
impl<T> ExtMem for Twhere
T: ?Sized,
Source§const NEEDS_DROP: bool = _
const NEEDS_DROP: bool = _
Source§fn mem_align_of<T>() -> usize
fn mem_align_of<T>() -> usize
Source§fn mem_align_of_val(&self) -> usize
fn mem_align_of_val(&self) -> usize
Source§fn mem_size_of<T>() -> usize
fn mem_size_of<T>() -> usize
Source§fn mem_size_of_val(&self) -> usize
fn mem_size_of_val(&self) -> usize
Source§fn mem_needs_drop(&self) -> bool
fn mem_needs_drop(&self) -> bool
true
if dropping values of this type matters. Read moreSource§fn mem_forget(self)where
Self: Sized,
fn mem_forget(self)where
Self: Sized,
self
without running its destructor. Read moreSource§fn mem_replace(&mut self, other: Self) -> Selfwhere
Self: Sized,
fn mem_replace(&mut self, other: Self) -> Selfwhere
Self: Sized,
Source§unsafe fn mem_zeroed<T>() -> T
unsafe fn mem_zeroed<T>() -> T
unsafe_layout
only.T
represented by the all-zero byte-pattern. Read moreSource§unsafe fn mem_transmute_copy<Src, Dst>(src: &Src) -> Dst
unsafe fn mem_transmute_copy<Src, Dst>(src: &Src) -> Dst
unsafe_layout
only.T
represented by the all-zero byte-pattern. Read moreSource§fn mem_as_bytes(&self) -> &[u8] ⓘ
fn mem_as_bytes(&self) -> &[u8] ⓘ
unsafe_slice
only.§impl<S> FromSample<S> for S
impl<S> FromSample<S> for S
fn from_sample_(s: S) -> S
Source§impl<T> Hook for T
impl<T> Hook for T
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more§impl<'py, T, I> IntoPyDict<'py> for Iwhere
T: PyDictItem<'py>,
I: IntoIterator<Item = T>,
impl<'py, T, I> IntoPyDict<'py> for Iwhere
T: PyDictItem<'py>,
I: IntoIterator<Item = T>,
§fn into_py_dict(self, py: Python<'py>) -> Result<Bound<'py, PyDict>, PyErr> ⓘ
fn into_py_dict(self, py: Python<'py>) -> Result<Bound<'py, PyDict>, PyErr> ⓘ
PyDict
object pointer. Whether pointer owned or borrowed
depends on implementation.§fn into_py_dict_bound(self, py: Python<'py>) -> Bound<'py, PyDict>
fn into_py_dict_bound(self, py: Python<'py>) -> Bound<'py, PyDict>
IntoPyDict::into_py_dict
IntoPyDict::into_py_dict
.