pub struct RqaResult {
pub rr: f64,
pub det: f64,
pub avg_line: f64,
pub l_max: usize,
pub entropy: f64,
pub lam: f64,
pub tt: f64,
}Expand description
Results of a recurrence quantification analysis.
Fields§
§rr: f64Recurrence Rate (RR): fraction of recurrence points.
det: f64Determinism (DET): fraction of recurrence points on diagonal lines.
avg_line: f64Average diagonal line length (L).
l_max: usizeLongest diagonal line length (L_max).
entropy: f64Entropy of diagonal line-length distribution.
lam: f64Laminarity (LAM): fraction of recurrence points in vertical lines.
tt: f64Trapping time (TT): average length of vertical lines.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for RqaResult
impl RefUnwindSafe for RqaResult
impl Send for RqaResult
impl Sync for RqaResult
impl Unpin for RqaResult
impl UnsafeUnpin for RqaResult
impl UnwindSafe for RqaResult
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
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.