pub struct Timing {
pub ping_after_ms: u64,
pub silent_ms: u64,
pub steady_ms: u64,
pub first_retry_ms: u64,
pub last_retry_ms: u64,
}Expand description
The clock’s rules, in milliseconds.
Fields§
§ping_after_ms: u64Ping a socket nothing has arrived on for this long. The venue closes one it has sent nothing to for 60 s; a ping makes it send a pong.
silent_ms: u64A socket nothing has arrived on for this long, pong included, is dead. The venue would have closed it by now; when no close came, the connection is half open.
steady_ms: u64A socket open this long that heard something worked: the next failure starts the reconnect delays over. One dropped sooner keeps backing off.
first_retry_ms: u64The first reconnect delay; each failure after doubles it.
last_retry_ms: u64The longest reconnect delay, before jitter adds up to a quarter.
Implementations§
Trait Implementations§
impl Copy for Timing
impl Eq for Timing
impl StructuralPartialEq for Timing
Auto Trait Implementations§
impl Freeze for Timing
impl RefUnwindSafe for Timing
impl Send for Timing
impl Sync for Timing
impl Unpin for Timing
impl UnsafeUnpin for Timing
impl UnwindSafe for Timing
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.