enum Danger {
Green,
Yellow,
Red(RandomState),
}
Expand description
Tracks the header map danger level! This relates to the adaptive hashing algorithm. A HeaderMap starts in the “green” state, when a large number of collisions are detected, it transitions to the yellow state. At this point, the header map will either grow and switch back to the green state OR it will transition to the red state.
When in the red state, a safe hashing algorithm is used and all values in the header map have to be rehashed.
Variants§
Implementations§
Trait Implementations§
Auto Trait Implementations§
impl Freeze for Danger
impl RefUnwindSafe for Danger
impl Send for Danger
impl Sync for Danger
impl Unpin for Danger
impl UnwindSafe for Danger
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