Struct Split 

pub struct Split<P, Q, R>(pub P, pub Q, pub R);

Split the connection into send-only and receive-only halves using split.

The type Split<P, Q, R> means: do the Transmit-only session P concurrently with the Receive-only session Q, running them both to Done, and when they’ve completed, do the session R.

Tuple Fields

0: P

1: Q

2: R

Trait Implementations

impl<P: 'static, Q: 'static, R: 'static> Actionable for Split<P, Q, R>

type NextAction = Split<P, Q, R>

The next actual channel action, which must be one of Send, Recv, Offer, Choose, Split, Call, or Done.

impl<P: Clone, Q: Clone, R: Clone> Clone for Split<P, Q, R>

fn clone(&self) -> Split<P, Q, R>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<P: Debug, Q: Debug, R: Debug> Debug for Split<P, Q, R>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<P: Default, Q: Default, R: Default> Default for Split<P, Q, R>

fn default() -> Split<P, Q, R>

Returns the “default value” for a type.

impl<P: HasDual, Q: HasDual, R: HasDual> HasDual for Split<P, Q, R>

type DualSession = Split<<Q as HasDual>::DualSession, <P as HasDual>::DualSession, <R as HasDual>::DualSession>

Note how the dual flips the position of P and Q, because P::Dual is a receiving session, and therefore belongs on the right of the split, and Q::Dual is a sending session, and therefore belongs on the left of the split.

impl<P: Hash, Q: Hash, R: Hash> Hash for Split<P, Q, R>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<N: Unary, Level: Unary, P: Lift<N, Level>, Q: Lift<N, Level>, R: Lift<N, Level>> Lift<N, Level> for Split<P, Q, R>

type Lifted = Split<<P as Lift<N, Level>>::Lifted, <Q as Lift<N, Level>>::Lifted, <R as Lift<N, Level>>::Lifted>

The result of the lifting operation.

impl<P: Ord, Q: Ord, R: Ord> Ord for Split<P, Q, R>

fn cmp(&self, other: &Split<P, Q, R>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<P: PartialEq, Q: PartialEq, R: PartialEq> PartialEq for Split<P, Q, R>

fn eq(&self, other: &Split<P, Q, R>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<P: PartialOrd, Q: PartialOrd, R: PartialOrd> PartialOrd for Split<P, Q, R>

fn partial_cmp(&self, other: &Split<P, Q, R>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<N: Unary, P: Subst<S, N>, Q: Subst<S, N>, R: Subst<S, N>, S> Subst<S, N> for Split<P, Q, R>

type Substituted = Split<<P as Subst<S, N>>::Substituted, <Q as Subst<S, N>>::Substituted, <R as Subst<S, N>>::Substituted>

The result of the substitution.

impl<N: Unary, P: 'static, Q: 'static, R: Then<S, N>, S> Then<S, N> for Split<P, Q, R>

type Combined = Split<P, Q, <R as Then<S, N>>::Combined>

The combined type resulting from substituting P for Done in Self.

impl<P: Copy, Q: Copy, R: Copy> Copy for Split<P, Q, R>

impl<P: Eq, Q: Eq, R: Eq> Eq for Split<P, Q, R>

impl<N: Unary, P: Scoped<N>, Q: Scoped<N>, R: Scoped<N>> Scoped<N> for Split<P, Q, R>

impl<P, Q, R> StructuralPartialEq for Split<P, Q, R>