Enum Strategy 

pub enum Strategy {
    PreferenceOrder,
    LowestUtilization,
    SoonestReset,
}

Ordering strategy among eligible accounts. All are deterministic.

Variants

PreferenceOrder

First eligible account in the operator’s preference list; unlisted accounts follow in storage-key order.

LowestUtilization

Lowest maximum utilization across applicable windows; ties broken by preference order, then storage key. Accounts whose utilization is unknown (but proven not limit-reached) sort after known ones.

SoonestReset

Perishable capacity first. Eligible seats are ranked by Eligible::tier (1 = urgent anchored, 2 = unanchored, 3 = anchored but not urgent, 4 = no reset evidence); tiers 1 and 3 order by soonest budget reset, tier 2 by preference then storage key, tier 4 by lowest utilization. Remaining ties: lowest utilization → preference → storage key. The only strategy to which SelectionRequest::sticky applies.

Trait Implementations

impl Clone for Strategy

fn clone(&self) -> Strategy

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for Strategy

impl Debug for Strategy

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for Strategy

fn deserialize<__D>( __deserializer: __D, ) -> Result<Strategy, <__D as Deserializer<'de>>::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for Strategy

impl PartialEq for Strategy

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

Equality operator ==.

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

Inequality operator !=.

impl Serialize for Strategy

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for Strategy