pub struct MixerRun<A> {
pub commands: A,
pub status: MixerStatus,
}Fields§
§commands: A§status: MixerStatusTrait Implementations§
Source§impl<A: PartialEq> PartialEq for MixerRun<A>
impl<A: PartialEq> PartialEq for MixerRun<A>
impl<A: Copy> Copy for MixerRun<A>
impl<A> StructuralPartialEq for MixerRun<A>
Auto Trait Implementations§
impl<A> Freeze for MixerRun<A>where
A: Freeze,
impl<A> RefUnwindSafe for MixerRun<A>where
A: RefUnwindSafe,
impl<A> Send for MixerRun<A>where
A: Send,
impl<A> Sync for MixerRun<A>where
A: Sync,
impl<A> Unpin for MixerRun<A>where
A: Unpin,
impl<A> UnsafeUnpin for MixerRun<A>where
A: UnsafeUnpin,
impl<A> UnwindSafe for MixerRun<A>where
A: UnwindSafe,
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§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 more§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).§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.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.