Struct QueueKey 

pub struct QueueKey {
    pub lt: u64,
    pub hash: HashBytes,
}

Queue key.

Fields

lt: u64

hash: HashBytes

Implementations

impl QueueKey

pub const SIZE_HINT: usize = 40usize

pub const MIN: Self

pub const MAX: Self

pub const fn min_for_lt(lt: u64) -> Self

pub const fn max_for_lt(lt: u64) -> Self

pub fn next_value(&self) -> Self

pub const fn split(self) -> (u64, HashBytes)

Trait Implementations

impl Clone for QueueKey

fn clone(&self) -> QueueKey

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for QueueKey

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

Formats the value using the given formatter.

impl Default for QueueKey

fn default() -> QueueKey

Returns the “default value” for a type.

impl Display for QueueKey

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

Formats the value using the given formatter.

impl From<(u64, HashBytes)> for QueueKey

fn from((lt, hash): (u64, HashBytes)) -> Self

Converts to this type from the input type.

impl From<QueueKey> for (u64, HashBytes)

fn from(key: QueueKey) -> Self

Converts to this type from the input type.

impl Hash for QueueKey

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 Ord for QueueKey

fn cmp(&self, other: &QueueKey) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for QueueKey

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

fn partial_cmp(&self, other: &QueueKey) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl StoredValue for QueueKey

Available on crate feature storage only.

const SIZE_HINT: usize = 40usize

On-stack buffer size hint

type OnStackSlice = [u8; 40]

On-stack buffer type (see smallvec::SmallVec)

fn serialize<T: StoredValueBuffer>(&self, buffer: &mut T)

Serializes the data to the buffer

fn deserialize(reader: &mut &[u8]) -> Self

Deserializes the data from the buffer.

fn from_slice(data: &[u8]) -> Self

where Self: Sized,

Deserializes the data from the buffer.

fn to_vec(&self) -> SmallVec<Self::OnStackSlice>

Constructs on-stack buffer with the serialized object

impl<'tl> TlRead<'tl> for QueueKey

type Repr = Bare

Serialized object representation.

fn read_from(__packet: &mut &'tl [u8]) -> TlResult<Self>

Tries to read itself from bytes at the specified offset, incrementing that offset.

impl TlWrite for QueueKey

type Repr = Bare

Serialized object representation.

fn max_size_hint(&self) -> usize

Max required number of bytes.

fn write_to<P_>(&self, __packet: &mut P_)

where P_: TlPacket,

Writes itself to the specified TlPacket.

impl Copy for QueueKey

impl Eq for QueueKey

impl StructuralPartialEq for QueueKey