Struct CompositeQueueKey 

pub struct CompositeQueueKey {
    pub priority: i64,
    pub timestamp: u64,
    pub sequence: u64,
    pub task_id: String,
}

Composite key for queue ordering

Encodes: priority + timestamp + sequence for deterministic ordering.

Fields

priority: i64

Primary sort: priority (lower = more urgent)

timestamp: u64

Secondary sort: ready timestamp

sequence: u64

Tertiary sort: sequence number (for FIFO within same priority/time)

task_id: String

Task identifier

Implementations

impl CompositeQueueKey

pub fn new( priority: i64, timestamp: u64, sequence: u64, task_id: impl Into<String>, ) -> Self

Create a new composite key

pub fn encode(&self) -> Vec<u8>

Encode to bytes for storage

pub fn decode(bytes: &[u8]) -> Option<Self>

Decode from bytes

Trait Implementations

impl Clone for CompositeQueueKey

fn clone(&self) -> CompositeQueueKey

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for CompositeQueueKey

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

Formats the value using the given formatter.

impl Eq for CompositeQueueKey

impl Hash for CompositeQueueKey

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 CompositeQueueKey

fn cmp(&self, other: &CompositeQueueKey) -> 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 CompositeQueueKey

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

fn partial_cmp(&self, other: &CompositeQueueKey) -> 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 StructuralPartialEq for CompositeQueueKey