pub struct SortedReferenceState { /* private fields */ }Expand description
Pre-sorted reference values at each time point for O(log N) rank queries.
Constructed once from a column-major reference matrix and then shared (immutably) by any number of streaming depth estimators.
Implementations§
Source§impl SortedReferenceState
impl SortedReferenceState
Sourcepub fn from_reference(data_ori: &FdMatrix) -> Self
pub fn from_reference(data_ori: &FdMatrix) -> Self
Build from a column-major reference matrix.
data_ori– reference matrix of shapenori × n_points
Complexity: O(T × N log N) (parallelised over time points).
Auto Trait Implementations§
impl Freeze for SortedReferenceState
impl RefUnwindSafe for SortedReferenceState
impl Send for SortedReferenceState
impl Sync for SortedReferenceState
impl Unpin for SortedReferenceState
impl UnsafeUnpin for SortedReferenceState
impl UnwindSafe for SortedReferenceState
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.