pub enum TimestampOrder {
Unkeyed,
Ascending,
Unordered,
}Expand description
How a log buffer’s timestamps stand for a search by time
(LogBufferRecords::timestamp_order).
Variants§
Unkeyed
Some resident timestamp is not an actual moment
(TimestampKey::of refuses it), so the buffer can’t be searched by
time at all.
Ascending
Every timestamp is an actual moment and none is earlier than the one before it, so a search can bisect them.
Unordered
Every timestamp is an actual moment, but the clock went back at least once, so a search has to visit each record.
Trait Implementations§
Source§impl Clone for TimestampOrder
impl Clone for TimestampOrder
impl Copy for TimestampOrder
Source§impl Debug for TimestampOrder
impl Debug for TimestampOrder
impl Eq for TimestampOrder
Source§impl PartialEq for TimestampOrder
impl PartialEq for TimestampOrder
impl StructuralPartialEq for TimestampOrder
Auto Trait Implementations§
impl Freeze for TimestampOrder
impl RefUnwindSafe for TimestampOrder
impl Send for TimestampOrder
impl Sync for TimestampOrder
impl Unpin for TimestampOrder
impl UnsafeUnpin for TimestampOrder
impl UnwindSafe for TimestampOrder
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