pub struct ComposeHandle { /* private fields */ }Expand description
Producer side of a spawned node (ReconNode::spawn).
Implementations§
Source§impl ComposeHandle
impl ComposeHandle
Sourcepub fn send(&self, state: FrameState) -> Result<(), SendError>
pub fn send(&self, state: FrameState) -> Result<(), SendError>
Queues a state. Under Block waits for room; never waits otherwise.
Sourcepub fn try_send(&self, state: FrameState) -> Result<(), SendError>
pub fn try_send(&self, state: FrameState) -> Result<(), SendError>
Queues a state without waiting (Block returns SendError::Full when full).
Sourcepub fn send_all(
&self,
states: impl IntoIterator<Item = FrameState>,
) -> Result<(), SendError>
pub fn send_all( &self, states: impl IntoIterator<Item = FrameState>, ) -> Result<(), SendError>
Queues every state of a source (iterator, channel receiver, …) with ComposeHandle::send.
Sourcepub fn stats(&self) -> QueueStats
pub fn stats(&self) -> QueueStats
Queue counters.
Sourcepub fn close(
self,
) -> (Vec<Result<Outcome, ComposeError>>, Result<Closed, ComposeError>)
pub fn close( self, ) -> (Vec<Result<Outcome, ComposeError>>, Result<Closed, ComposeError>)
Sends End, waits for the worker to compose everything queued, and closes the node.
Returns the per-state outcomes (in queue order) and the close result.
Trait Implementations§
Source§impl Debug for ComposeHandle
impl Debug for ComposeHandle
Source§impl Drop for ComposeHandle
impl Drop for ComposeHandle
Auto Trait Implementations§
impl !RefUnwindSafe for ComposeHandle
impl !UnwindSafe for ComposeHandle
impl Freeze for ComposeHandle
impl Send for ComposeHandle
impl Sync for ComposeHandle
impl Unpin for ComposeHandle
impl UnsafeUnpin for ComposeHandle
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
Mutably borrows from an owned value. Read more
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T, U> Imply<T> for U
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> ⓘ
Converts
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> ⓘ
Converts
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 moreSource§impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.