Struct Explorer 

pub struct Explorer<'a> {
    pub trace: &'a Trace,
    pub timeline: &'a Timeline,
    /* private fields */
}

Reuse a recording’s already-built timeline; constructing an explorer is linear in spans, with self costs computed against the unfiltered tree.

Fields

trace: &'a Trace

timeline: &'a Timeline

Implementations

impl<'a> Explorer<'a>

pub fn new(trace: &'a Trace, timeline: &'a Timeline) -> Self

pub fn with_index( trace: &'a Trace, timeline: &'a Timeline, index: &'a Index, ) -> Self

pub fn into_index(self) -> Index

pub fn frame_index(&self, id: u64) -> Option<usize>

pub fn frame_detail(&self, index: usize) -> FrameDetail

pub fn span_detail(&self, id: u32) -> Option<SpanDetail>

pub fn frame_for_time(&self, t: u64) -> Option<usize>

pub fn resolve( &self, selection: &Selection, filter: &Filter, ) -> Result<Scope, String>

pub fn keeps_frame(&self, i: usize, filter: &Filter) -> bool

pub fn keeps_span(&self, s: &Span, filter: &Filter) -> bool

pub fn selected_spans<'b>( &'b self, scope: &'b Scope, filter: &'b Filter, ) -> impl Iterator<Item = (usize, &'a Span)> + 'b

pub fn summary(&self, scope: &Scope) -> Summary

pub fn span_groups(&self, scope: &Scope, filter: &Filter) -> Vec<SpanGroup>

pub fn origins(&self, scope: &Scope, filter: &Filter) -> Vec<(Origin, u64, u64)>

pub fn counters(&self, scope: &Scope) -> (Vec<Counter>, Vec<Gauge>)

pub fn readings(&self, scope: &Scope, filter: &Filter) -> Readings

The viewer’s complete tables, without CLI result limits. Attribution uses the original tree; placements/gaps describe the frame population.

pub fn execute(&self, query: &Query) -> Result<ResultSet, String>

Trait Implementations

impl Deref for Explorer<'_>

type Target = Index

The resulting type after dereferencing.

fn deref(&self) -> &Index

Dereferences the value.