Enum WaiterKey 

pub enum WaiterKey {
    Tid(u16),
    Fifo,
}

Key used to route an incoming frame to the right pending waiter.

• WaiterKey::Tid: TCP requests get a fresh transaction ID per request; the slave echoes that TID in its response, so the master can demux pipelined responses back to their requesters even when several are in flight at once.
• WaiterKey::Fifo: RTU and ASCII have no transaction ID, and FIFO serialization guarantees there is at most one outstanding waiter at any given time, so a single shared key is sufficient.

Variants

Tid(u16)

Fifo

Trait Implementations

impl Clone for WaiterKey

fn clone(&self) -> WaiterKey

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for WaiterKey

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

Formats the value using the given formatter.

impl Hash for WaiterKey

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 PartialEq for WaiterKey

fn eq(&self, other: &WaiterKey) -> 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 Copy for WaiterKey

impl Eq for WaiterKey

impl StructuralPartialEq for WaiterKey