Struct Replay 

pub struct Replay {
    pub jobs: u64,
    pub never_started: u64,
    pub wait: Spread,
    pub mean_wait: u64,
    pub most_running: u64,
    pub worst_overlap: u64,
    pub makespan: u64,
    pub under_predicted: u64,
    pub held_back: u64,
    pub cpu_held: u64,
    pub worst_cpu: u64,
}

What a replay did with the history’s jobs.

Fields

jobs: u64

The jobs replayed: finished ones of a configured profile.

never_started: u64

Of those, the ones the policy never started: more than the budget holds.

wait: Spread

Seconds from queued to started.

mean_wait: u64

The mean of those, in seconds.

most_running: u64

The most jobs that ran at once.

worst_overlap: u64

The most memory, in bytes, the running jobs’ peaks and the mirror add up to at one moment: as if every running job peaked at once, which is more than the slice ever holds. Not a bound on the daemon, which can overlap more: it sees what jobs use, less than their peaks while they warm up, and the replay leaves out start latency, seeds, shells and cancelled jobs.

makespan: u64

Seconds from the first job queued to the last one finished.

under_predicted: u64

Jobs whose peak was above what admission reserved for them when they ended.

held_back: u64

How many times the high-water mark held a job back that the predictions had room for.

cpu_held: u64

How many times the CPU budget held a job back that memory and its slots had room for.

worst_cpu: u64

The most CPU, in millicores, the running jobs’ averages add up to at one moment.

Trait Implementations

impl Clone for Replay

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Replay

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

Formats the value using the given formatter.

impl Eq for Replay

impl PartialEq for Replay

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Replay