#[non_exhaustive]pub enum Congestion {
Loss,
Delay,
}Expand description
Variants (Non-exhaustive)§
This enum is marked as non-exhaustive
Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.
Loss
Loss-based: grows until it drops packets, so the send rate sawtooths.
Delay
Delay-based: tracks the measured delivery rate and RTT instead of waiting for loss, which keeps queues short and the send rate steady enough for an encoder to track.
Trait Implementations§
Source§impl Clone for Congestion
impl Clone for Congestion
impl Copy for Congestion
Source§impl Debug for Congestion
impl Debug for Congestion
Source§impl Default for Congestion
impl Default for Congestion
impl Eq for Congestion
Source§impl PartialEq for Congestion
impl PartialEq for Congestion
impl StructuralPartialEq for Congestion
Auto Trait Implementations§
impl Freeze for Congestion
impl RefUnwindSafe for Congestion
impl Send for Congestion
impl Sync for Congestion
impl Unpin for Congestion
impl UnsafeUnpin for Congestion
impl UnwindSafe for Congestion
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,
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.