pub struct RecurrenceAnalysis {
pub recurrence_rate: f64,
pub determinism: f64,
pub mean_diagonal_length: f64,
pub max_diagonal_length: usize,
pub diagonal_entropy: f64,
pub laminarity: f64,
pub trapping_time: f64,
}Expand description
Recurrence quantification analysis (RQA) results.
Summarises the statistical structure of a recurrence plot via standard RQA measures.
Fields§
§recurrence_rate: f64Recurrence rate (RR): fraction of recurrent points.
determinism: f64Determinism (DET): fraction of recurrent points on diagonal lines ≥ min_line.
mean_diagonal_length: f64Mean diagonal line length (L_mean).
max_diagonal_length: usizeLongest diagonal line length (L_max).
diagonal_entropy: f64Entropy of diagonal line-length distribution (Shannon).
laminarity: f64Laminarity (LAM): fraction of recurrent points on vertical lines ≥ min_line.
trapping_time: f64Trapping time (TT): mean vertical line length.
Implementations§
Source§impl RecurrenceAnalysis
impl RecurrenceAnalysis
Sourcepub fn compute(rp: &RecurrencePlot, min_line: usize) -> Self
pub fn compute(rp: &RecurrencePlot, min_line: usize) -> Self
Compute full RQA from a recurrence plot with minimum line length min_line.
min_line is the minimum length (≥ 1) for a line to be counted.
Trait Implementations§
Source§impl Clone for RecurrenceAnalysis
impl Clone for RecurrenceAnalysis
Source§fn clone(&self) -> RecurrenceAnalysis
fn clone(&self) -> RecurrenceAnalysis
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreAuto Trait Implementations§
impl Freeze for RecurrenceAnalysis
impl RefUnwindSafe for RecurrenceAnalysis
impl Send for RecurrenceAnalysis
impl Sync for RecurrenceAnalysis
impl Unpin for RecurrenceAnalysis
impl UnsafeUnpin for RecurrenceAnalysis
impl UnwindSafe for RecurrenceAnalysis
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.