Struct Timing 

pub struct Timing { /* private fields */ }

The timing information for an instrumented future.

The busy time and the idle time of the instrumented future is available.

Busy time

The busy time of a future is the sum of all the time consumed during calls to Future::poll on that future.

The busy time will always be non-zero.

Idle time

The idle time of a future is the sum of all the time between calls to Future::poll. The time before the first poll is not included.

The idle time may be zero if the inner future returns Poll::Ready on the first poll (and so never returns Poll::Pending).

Implementations

impl Timing

pub fn busy(&self) -> Duration

The sum of all poll durations.

This is the total time the future was polled across all polls.

pub fn idle(&self) -> Duration

The sum of all durations between polls.

This is the total time between each poll of the timed future. The time before the first poll and after the final poll is not included.

Trait Implementations

impl Clone for Timing

fn clone(&self) -> Timing

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Timing

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

Formats the value using the given formatter.

impl Hash for Timing

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 Timing

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for Timing

impl StructuralPartialEq for Timing