Struct EventFinder 

pub struct EventFinder { /* private fields */ }

Uniform-scan event finder over a finite time window.

Implementations

impl EventFinder

pub fn new( start_seconds: f64, end_seconds: f64, step_seconds: f64, time_tolerance_seconds: f64, ) -> Result<Self, EventFinderError>

Construct an event finder over [start_seconds, end_seconds].

pub fn start_seconds(self) -> f64

Start of the search window.

pub fn end_seconds(self) -> f64

End of the search window.

pub fn step_seconds(self) -> f64

Uniform coarse-scan step.

pub fn time_tolerance_seconds(self) -> f64

Event-time refinement tolerance.

pub fn find_crossings<P>( self, predicate: P, threshold: f64, ) -> Result<Vec<CrossingEvent>, EventFinderError>

where P: ScalarEventPredicate,

Find refined threshold crossings of a scalar predicate.

pub fn find_crossings_batch_serial<P>( self, predicates: &[P], threshold: f64, ) -> Vec<Result<Vec<CrossingEvent>, EventFinderError>>

where P: ScalarEventPredicate,

Find threshold crossings for a batch of scalar predicates, serially.

Result element i belongs to predicates[i].

pub fn find_crossings_batch_parallel<P>( self, predicates: &[P], threshold: f64, ) -> Vec<Result<Vec<CrossingEvent>, EventFinderError>>

where P: ScalarEventPredicate + Sync,

Find threshold crossings for a batch of scalar predicates in parallel.

Each predicate is evaluated by the same kernel as EventFinder::find_crossings. The indexed collect preserves input order, so result element i belongs to predicates[i].

pub fn find_extrema<P>( self, predicate: P, ) -> Result<Vec<ExtremumEvent>, EventFinderError>

where P: ScalarEventPredicate,

Find refined local maxima and minima of a scalar predicate.

pub fn find_extrema_batch_serial<P>( self, predicates: &[P], ) -> Vec<Result<Vec<ExtremumEvent>, EventFinderError>>

where P: ScalarEventPredicate,

Find local extrema for a batch of scalar predicates, serially.

Result element i belongs to predicates[i].

pub fn find_extrema_batch_parallel<P>( self, predicates: &[P], ) -> Vec<Result<Vec<ExtremumEvent>, EventFinderError>>

where P: ScalarEventPredicate + Sync,

Find local extrema for a batch of scalar predicates in parallel.

Each predicate is evaluated by the same kernel as EventFinder::find_extrema. The indexed collect preserves input order, so result element i belongs to predicates[i].

pub fn find_state_changes<P>( self, predicate: P, ) -> Result<Vec<StateChangeEvent>, EventFinderError>

where P: DiscreteEventPredicate,

Find refined changes of a boolean state predicate.

pub fn find_state_changes_batch_serial<P>( self, predicates: &[P], ) -> Vec<Result<Vec<StateChangeEvent>, EventFinderError>>

where P: DiscreteEventPredicate,

Find state changes for a batch of discrete predicates, serially.

Result element i belongs to predicates[i].

pub fn find_state_changes_batch_parallel<P>( self, predicates: &[P], ) -> Vec<Result<Vec<StateChangeEvent>, EventFinderError>>

where P: DiscreteEventPredicate + Sync,

Find state changes for a batch of discrete predicates in parallel.

Each predicate is evaluated by the same kernel as EventFinder::find_state_changes. The indexed collect preserves input order, so result element i belongs to predicates[i].

Trait Implementations

impl Clone for EventFinder

fn clone(&self) -> EventFinder

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for EventFinder

impl Debug for EventFinder

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

Formats the value using the given formatter.

impl PartialEq for EventFinder

fn eq(&self, other: &EventFinder) -> 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 StructuralPartialEq for EventFinder