Struct Store 

pub struct Store {
    pub(crate) spans: Vec<Span>,
    pub(crate) self_time_tree: Option<SelfTimeTree<NonZeroUsize>>,
    max_self_time_lookup_time: AtomicU64,
    memory_samples: Vec<(Timestamp, u64)>,
}

Fields

spans: Vec<Span>

self_time_tree: Option<SelfTimeTree<NonZeroUsize>>

max_self_time_lookup_time: AtomicU64

memory_samples: Vec<(Timestamp, u64)>

Global sorted list of memory samples (timestamp, memory_bytes).

Implementations

impl Store

pub fn new() -> Self

pub fn reset(&mut self)

pub fn has_time_info(&self) -> bool

pub fn add_span( &mut self, parent: Option<NonZeroUsize>, start: Timestamp, category: String, name: String, args: Vec<(String, String)>, outdated_spans: &mut FxHashSet<NonZeroUsize>, ) -> NonZeroUsize

pub fn add_args( &mut self, span_index: NonZeroUsize, args: Vec<(String, String)>, outdated_spans: &mut FxHashSet<NonZeroUsize>, )

pub fn set_max_self_time_lookup(&self, time: Timestamp)

fn insert_self_time( &mut self, start: Timestamp, end: Timestamp, span_index: NonZeroUsize, outdated_spans: &mut FxHashSet<NonZeroUsize>, )

pub fn add_self_time( &mut self, span_index: NonZeroUsize, start: Timestamp, end: Timestamp, outdated_spans: &mut FxHashSet<NonZeroUsize>, )

pub fn set_total_time( &mut self, span_index: NonZeroUsize, start_time: Timestamp, total_time: Timestamp, outdated_spans: &mut FxHashSet<NonZeroUsize>, )

pub fn set_parent( &mut self, span_index: NonZeroUsize, parent: NonZeroUsize, outdated_spans: &mut FxHashSet<NonZeroUsize>, )

pub fn add_allocation( &mut self, span_index: NonZeroUsize, allocation: u64, count: u64, outdated_spans: &mut FxHashSet<NonZeroUsize>, )

pub fn add_deallocation( &mut self, span_index: NonZeroUsize, deallocation: u64, count: u64, outdated_spans: &mut FxHashSet<NonZeroUsize>, )

pub fn add_memory_sample(&mut self, ts: Timestamp, memory: u64)

pub fn memory_samples_for_range( &self, start: Timestamp, end: Timestamp, ) -> Vec<u64>

Returns up to MAX_MEMORY_SAMPLES memory samples in the range [start, end]. When more samples exist, groups of N consecutive samples are merged by taking the maximum memory value in each group.

pub fn complete_span(&mut self, span_index: NonZeroUsize)

pub fn invalidate_outdated_spans( &mut self, outdated_spans: &FxHashSet<NonZeroUsize>, )

pub fn root_spans(&self) -> impl Iterator<Item = SpanRef<'_>>

pub fn root_span(&self) -> SpanRef<'_>

pub fn span(&self, id: NonZeroUsize) -> Option<(SpanRef<'_>, bool)>