Enum shared_queue::QueueOpsChoice

source · [−]

pub enum QueueOpsChoice<EnqueueT, DequeueT> {
    Enqueue(EnqueueT),
    Dequeue(DequeueT),
}

Variants

`Enqueue(EnqueueT)`

`Dequeue(DequeueT)`

Trait Implementations

source

impl<EnqueueT, DequeueT> From<Sum<EnqueueT, Sum<DequeueT, Bottom>>> for QueueOpsChoice<EnqueueT, DequeueT>

source

fn from(row: Sum<EnqueueT, Sum<DequeueT, Bottom>>) -> Self

Converts to this type from the input type.

Auto Trait Implementations

impl<EnqueueT, DequeueT> RefUnwindSafe for QueueOpsChoice<EnqueueT, DequeueT> where
DequeueT: RefUnwindSafe,
EnqueueT: RefUnwindSafe,

impl<EnqueueT, DequeueT> Send for QueueOpsChoice<EnqueueT, DequeueT> where
DequeueT: Send,
EnqueueT: Send,

impl<EnqueueT, DequeueT> Sync for QueueOpsChoice<EnqueueT, DequeueT> where
DequeueT: Sync,
EnqueueT: Sync,

impl<EnqueueT, DequeueT> Unpin for QueueOpsChoice<EnqueueT, DequeueT> where
DequeueT: Unpin,
EnqueueT: Unpin,

impl<EnqueueT, DequeueT> UnwindSafe for QueueOpsChoice<EnqueueT, DequeueT> where
DequeueT: UnwindSafe,
EnqueueT: UnwindSafe,

Blanket Implementations

source

impl<T> Any for T where
T: 'static + ?Sized,

source

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

impl<T> Borrow<T> for T where
T: ?Sized,

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

impl<T> BorrowMut<T> for T where
T: ?Sized,

const: unstable · source

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

source

impl<T> From<T> for T

const: unstable · source

fn from(t: T) -> T

Returns the argument unchanged.

source

impl<T, F, A> HasRecApp<F, A> for T where
 F: 'static + RecApp<A, Applied = T>,
 A: 'static,
 T: 'static + Send,

source

fn get_applied(self: Box<T, Global>) -> Box<T, Global>

source

impl<'a, S, Row, F> HasSumApp<'a, Row, F> for S where
 F: TyCon,
 S: Send,
 Row: SumApp<'a, F, Applied = S>,

source

fn get_sum(self: Box<S, Global>) -> Box<<Row as SumApp<'a, F>>::Applied, Global> where
F: TyCon,
Row: SumApp<'a, F>,

source

fn get_sum_borrow(&self) -> &<Row as SumApp<'a, F>>::Applied where
F: TyCon,
Row: SumApp<'a, F>,

source

impl<'a, T, F, A> HasTypeApp<'a, F, A> for T where
T: Send,
F: TypeApp<'a, A, Applied = T>,

source

fn get_applied(self: Box<T, Global>) -> Box<T, Global>

source

fn get_applied_borrow(&self) -> &<F as TypeApp<'a, A>>::Applied where
F: TypeApp<'a, A>,

source

impl<T, U> Into for T where
U: From<T>,

const: unstable · source

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source

impl<T, U> TryFrom for T where
U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>

Performs the conversion.

source

impl<T, U> TryInto for T where
U: TryFrom<T>,

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

source

impl<V, T> VZip<V> for T where
V: MultiLane<T>,

source

fn vzip(self) -> V

source

Enum shared_queue::QueueOpsChoice

Variants

Enqueue(EnqueueT)

Dequeue(DequeueT)

Trait Implementations

impl<EnqueueT, DequeueT> From<Sum<EnqueueT, Sum<DequeueT, Bottom>>> for QueueOpsChoice<EnqueueT, DequeueT>

fn from(row: Sum<EnqueueT, Sum<DequeueT, Bottom>>) -> Self

Auto Trait Implementations

impl<EnqueueT, DequeueT> RefUnwindSafe for QueueOpsChoice<EnqueueT, DequeueT> where DequeueT: RefUnwindSafe, EnqueueT: RefUnwindSafe,

impl<EnqueueT, DequeueT> Send for QueueOpsChoice<EnqueueT, DequeueT> where DequeueT: Send, EnqueueT: Send,

impl<EnqueueT, DequeueT> Sync for QueueOpsChoice<EnqueueT, DequeueT> where DequeueT: Sync, EnqueueT: Sync,

impl<EnqueueT, DequeueT> Unpin for QueueOpsChoice<EnqueueT, DequeueT> where DequeueT: Unpin, EnqueueT: Unpin,

impl<EnqueueT, DequeueT> UnwindSafe for QueueOpsChoice<EnqueueT, DequeueT> where DequeueT: UnwindSafe, EnqueueT: UnwindSafe,

Blanket Implementations

impl<T> Any for T where T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for T where T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for T where T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<T> From<T> for T

fn from(t: T) -> T

impl<T, F, A> HasRecApp<F, A> for T where F: 'static + RecApp<A, Applied = T>, A: 'static, T: 'static + Send,

fn get_applied(self: Box<T, Global>) -> Box<T, Global>

impl<'a, S, Row, F> HasSumApp<'a, Row, F> for S where F: TyCon, S: Send, Row: SumApp<'a, F, Applied = S>,

fn get_sum(self: Box<S, Global>) -> Box<<Row as SumApp<'a, F>>::Applied, Global> where F: TyCon, Row: SumApp<'a, F>,

fn get_sum_borrow(&self) -> &<Row as SumApp<'a, F>>::Applied where F: TyCon, Row: SumApp<'a, F>,

impl<'a, T, F, A> HasTypeApp<'a, F, A> for T where T: Send, F: TypeApp<'a, A, Applied = T>,

fn get_applied(self: Box<T, Global>) -> Box<T, Global>

fn get_applied_borrow(&self) -> &<F as TypeApp<'a, A>>::Applied where F: TypeApp<'a, A>,

impl<T, U> Into<U> for T where U: From<T>,

fn into(self) -> U

impl<T, U> TryFrom<U> for T where U: Into<T>,

type Error = Infallible

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for T where U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

impl<V, T> VZip<V> for T where V: MultiLane<T>,

fn vzip(self) -> V

impl<F, A, X> HasRecApp<F, A> for X where X: HasRecApp<F, A>,

`Enqueue(EnqueueT)`

`Dequeue(DequeueT)`

impl<EnqueueT, DequeueT> RefUnwindSafe for QueueOpsChoice<EnqueueT, DequeueT> where
DequeueT: RefUnwindSafe,
EnqueueT: RefUnwindSafe,

impl<EnqueueT, DequeueT> Send for QueueOpsChoice<EnqueueT, DequeueT> where
DequeueT: Send,
EnqueueT: Send,

impl<EnqueueT, DequeueT> Sync for QueueOpsChoice<EnqueueT, DequeueT> where
DequeueT: Sync,
EnqueueT: Sync,

impl<EnqueueT, DequeueT> Unpin for QueueOpsChoice<EnqueueT, DequeueT> where
DequeueT: Unpin,
EnqueueT: Unpin,

impl<EnqueueT, DequeueT> UnwindSafe for QueueOpsChoice<EnqueueT, DequeueT> where
DequeueT: UnwindSafe,
EnqueueT: UnwindSafe,

impl<T> Any for T where
T: 'static + ?Sized,

impl<T> Borrow<T> for T where
T: ?Sized,

impl<T> BorrowMut<T> for T where
T: ?Sized,

impl<T, F, A> HasRecApp<F, A> for T where
F: 'static + RecApp<A, Applied = T>,
A: 'static,
T: 'static + Send,

impl<'a, S, Row, F> HasSumApp<'a, Row, F> for S where
F: TyCon,
S: Send,
Row: SumApp<'a, F, Applied = S>,

fn get_sum(self: Box<S, Global>) -> Box<<Row as SumApp<'a, F>>::Applied, Global> where
F: TyCon,
Row: SumApp<'a, F>,

fn get_sum_borrow(&self) -> &<Row as SumApp<'a, F>>::Applied where
F: TyCon,
Row: SumApp<'a, F>,

impl<'a, T, F, A> HasTypeApp<'a, F, A> for T where
T: Send,
F: TypeApp<'a, A, Applied = T>,

fn get_applied_borrow(&self) -> &<F as TypeApp<'a, A>>::Applied where
F: TypeApp<'a, A>,

impl<T, U> Into<U> for T where
U: From<T>,

impl<T, U> TryFrom<U> for T where
U: Into<T>,

impl<T, U> TryInto<U> for T where
U: TryFrom<T>,

impl<V, T> VZip<V> for T where
V: MultiLane<T>,

impl<F, A, X> HasRecApp<F, A> for X where
X: HasRecApp<F, A>,