Struct abstutil::time::Timer

pub struct Timer<'a> {
    results: Vec<String>,
    stack: Vec<StackEntry>,
    outermost_name: String,
    sink: Option<Box<dyn TimerSink + 'a>>,
}

Hierarchial magic

Fields

results: Vec<String>

stack: Vec<StackEntry>

outermost_name: String

sink: Option<Box<dyn TimerSink + 'a>>

Implementations

impl<'a> Timer<'a>

pub fn new<S: Into<String>>(raw_name: S) -> Timer<'a>

pub fn new_with_sink(name: &str, sink: Box<dyn TimerSink + 'a>) -> Timer<'a>

pub fn throwaway() -> Timer<'a>

fn temporary_println(&mut self, line: String)

pub fn done(self)

Used to end the scope of a timer early.

pub fn start<S: Into<String>>(&mut self, raw_name: S)

pub fn stop<S: Into<String>>(&mut self, raw_name: S)

pub fn start_iter<S: Into<String>>(&mut self, raw_name: S, total_items: usize)

pub fn next(&mut self)

pub fn cancel_iter_early(&mut self)

pub fn add_result(&mut self, elapsed: f64, line: String)

pub fn parallelize<I, O, F>( &mut self, timer_name: &str, requests: Vec<I>, cb: F ) -> Vec<O>

where I: Send, O: Send, F: Send + Clone + Copy + Fn(I) -> O,

Execute the callback over all requests, using all CPUs available. The order of the result is deterministic and matches the input.

pub fn parallelize_polite<I, O, F>( &mut self, timer_name: &str, requests: Vec<I>, cb: F ) -> Vec<O>

where I: Send, O: Send, F: Send + Clone + Copy + Fn(I) -> O,

Like parallelize, but leave one CPU free, to avoid thrashing the user’s system.

fn inner_parallelize<I, O, F>( &mut self, timer_name: &str, requests: Vec<I>, cb: F, num_cpus: u32 ) -> Vec<O>

where I: Send, O: Send, F: Send + Clone + Copy + Fn(I) -> O,

pub fn retain_parallelized<K, V, F>( &mut self, timer_name: &str, input: BTreeMap<K, V>, keep: F ) -> BTreeMap<K, V>

where K: Send + Ord, V: Send, F: Send + Sync + Clone + Copy + Fn(&V) -> bool,

Like BTreeMap::retain, but parallelized

pub fn read_file(&mut self, path: &str) -> Result<()>

Then the caller passes this in as a reader

Trait Implementations

impl<'a> Drop for Timer<'a>

fn drop(&mut self)

Executes the destructor for this type.

impl<'a> Read for Timer<'a>

fn read(&mut self, buf: &mut [u8]) -> Result<usize, Error>

Pull some bytes from this source into the specified buffer, returning how many bytes were read.

fn read_vectored(&mut self, bufs: &mut [IoSliceMut<'_>]) -> Result<usize, Error>

Like read, except that it reads into a slice of buffers.

fn is_read_vectored(&self) -> bool

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

Determines if this Reader has an efficient read_vectored implementation.

fn read_to_end(&mut self, buf: &mut Vec<u8>) -> Result<usize, Error>

Read all bytes until EOF in this source, placing them into buf.

fn read_to_string(&mut self, buf: &mut String) -> Result<usize, Error>

Read all bytes until EOF in this source, appending them to buf.

fn read_exact(&mut self, buf: &mut [u8]) -> Result<(), Error>

Read the exact number of bytes required to fill buf.

fn read_buf(&mut self, buf: BorrowedCursor<'_>) -> Result<(), Error>

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

Pull some bytes from this source into the specified buffer.

fn read_buf_exact(&mut self, cursor: BorrowedCursor<'_>) -> Result<(), Error>

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

Read the exact number of bytes required to fill cursor.

fn by_ref(&mut self) -> &mut Self

where Self: Sized,

Creates a “by reference” adaptor for this instance of Read.

fn bytes(self) -> Bytes<Self>

where Self: Sized,

Transforms this Read instance to an Iterator over its bytes.

fn chain<R>(self, next: R) -> Chain<Self, R>

where R: Read, Self: Sized,

Creates an adapter which will chain this stream with another.

fn take(self, limit: u64) -> Take<Self>

where Self: Sized,

Creates an adapter which will read at most limit bytes from it.