Struct TemporalIndex 

pub struct TemporalIndex<T> { /* private fields */ }

Temporal index for efficient time-based queries.

Uses a B-tree for O(log n) range queries.

Implementations

impl<T: Clone> TemporalIndex<T>

pub fn new() -> Self

Create an empty temporal index.

pub fn from_iter<I, F>(iter: I, timestamp_fn: F) -> Self

where I: IntoIterator<Item = T>, F: Fn(&T) -> &Timestamp,

Create a temporal index from items with a timestamp extractor.

pub fn insert(&mut self, item: T, timestamp: &Timestamp)

Insert an item into the index.

pub fn query_range(&self, range: &TimeRange) -> Vec<&T>

Query items within a time range (inclusive).

pub fn before(&self, timestamp: &Timestamp) -> Vec<&T>

Query items before a timestamp.

pub fn after(&self, timestamp: &Timestamp) -> Vec<&T>

Query items after a timestamp.

pub fn at_or_before(&self, timestamp: &Timestamp) -> Vec<&T>

Query items at or before a timestamp.

pub fn at_or_after(&self, timestamp: &Timestamp) -> Vec<&T>

Query items at or after a timestamp.

pub fn first(&self) -> Option<&T>

Get the first (earliest) item.

pub fn last(&self) -> Option<&T>

Get the last (latest) item.

pub fn chronological(&self) -> Vec<&T>

Returns items in chronological order.

pub fn reverse_chronological(&self) -> Vec<&T>

Returns items in reverse chronological order.

pub fn time_range(&self) -> Option<TimeRange>

Returns the time range spanned by all items.

pub fn sliding_window(&self, window_size: Duration) -> SlidingWindowIter<'_, T>

Create a sliding window iterator over the items.

pub fn len(&self) -> usize

Returns the number of indexed items.

pub fn is_empty(&self) -> bool

Returns true if the index is empty.

pub fn items(&self) -> &[T]

Get all items in the index.

Trait Implementations

impl<T: Debug> Debug for TemporalIndex<T>

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

Formats the value using the given formatter.

impl<T: Clone> Default for TemporalIndex<T>

fn default() -> Self

Returns the “default value” for a type.