Struct PagerStats 

pub struct PagerStats {
    pub hits: u64,
    pub misses: u64,
    pub bytes_read: u64,
    pub bytes_served: u64,
    pub evictions: u64,
}

What paging cost, in the terms the planner priced it in.

Fields

hits: u64

Expert reads served from RAM.

misses: u64

Expert reads that went to disk.

bytes_read: u64

Bytes actually read from storage.

bytes_served: u64

Bytes served from the cache (what the disk did not have to move).

evictions: u64

Experts dropped to stay inside the budget.

Implementations

impl PagerStats

pub fn hit_rate(&self) -> f64

Share of expert reads served without touching disk, in 0..=1.

The number that decides whether paging is viable for a given model: a router that spreads uniformly over 288 experts has almost no reuse to exploit and this stays near zero however large the budget, whereas a peaked router turns most of the IO term into memcpy.

Trait Implementations

impl Clone for PagerStats

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 PagerStats

impl Debug for PagerStats

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

Formats the value using the given formatter.

impl Default for PagerStats

fn default() -> Self

Returns the “default value” for a type.

impl Eq for PagerStats

impl PartialEq for PagerStats

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for PagerStats