Enum Lane 

pub enum Lane {
    Cheap,
    Read,
    Write,
}

The three cost shapes a transfer can have, and the thing a lane floor protects.

See OpClass::lane for why the split exists at all, and Governor::lane_ceiling for what a floor actually reserves.

Variants

Cheap

A ref advertisement: no pack, milliseconds, 4 MiB.

Read

A pack out of the store — clone and fetch. Mostly page cache.

Write

A pack in, and the indexer behind it — push and gc.

Implementations

impl Lane

pub const ALL: [Lane; 3]

Every lane, in index order; the per-lane arrays are sized from this.

pub const COUNT: usize

How many lanes there are.

pub const fn index(self) -> usize

Index into the per-lane arrays.

pub const fn name(self) -> &'static str

The name a log or a counter uses.

pub const fn floor_share(self) -> (usize, usize)

The slots of the governed limit this lane is guaranteed, as limit * numerator / denominator, never below Lane::floor_min.

An eighth for cheap and a quarter for read: a write storm can take at most five eighths of the box, so an ls-remote and a clone always have somewhere to land. write reserves nothing, because it is the lane that would starve the others and it is never the one that is starved — whatever the other two are not using is its.

pub const fn floor_min(self) -> usize

The smallest floor a lane keeps however small the limit is.

Two, not one: one slot means a single stuck operation closes the lane, and a lane floor exists precisely so that a lane cannot be closed by what is happening in another one.

pub fn floor(self, limit: usize) -> usize

This lane’s guaranteed slots under a governed limit of limit.

Trait Implementations

impl Clone for Lane

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for Lane

impl Debug for Lane

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

Formats the value using the given formatter.

impl Display for Lane

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

Formats the value using the given formatter.

impl Eq for Lane

impl Hash for Lane

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 Lane

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

fn clamp_to<R>(self, range: R) -> Self

where Self: Sized, R: ClampBounds<Self>,

🔬This is a nightly-only experimental API. (clamp_to)

Restrict a value to a certain range.

impl PartialEq for Lane

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

Equality operator ==.

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

Inequality operator !=.

impl PartialOrd for Lane

fn partial_cmp(&self, other: &Self) -> 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 Lane