Enum QueueOrdering 

pub enum QueueOrdering {
    Fifo,
    Fastest,
}

Per-queue job execution ordering policy.

Variants

Fifo

Process jobs in exact First-In, First-Out order by creation time (created_at ASC).

Fastest

Process jobs as fast as possible without strict creation order guarantees.

Trait Implementations

impl Clone for QueueOrdering

fn clone(&self) -> QueueOrdering

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for QueueOrdering

impl Debug for QueueOrdering

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

Formats the value using the given formatter.

impl Default for QueueOrdering

fn default() -> QueueOrdering

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for QueueOrdering

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for QueueOrdering

impl Hash for QueueOrdering

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 PartialEq for QueueOrdering

fn eq(&self, other: &QueueOrdering) -> bool

Equality operator ==.

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

Inequality operator !=.

impl Serialize for QueueOrdering

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for QueueOrdering