pub struct BenfordAnalysis {
pub sample_size: usize,
pub observed_frequencies: [f64; 9],
pub observed_counts: [u64; 9],
pub expected_frequencies: [f64; 9],
pub chi_squared: f64,
pub degrees_of_freedom: u32,
pub p_value: f64,
pub mad: f64,
pub conformity: BenfordConformity,
pub max_deviation: (u8, f64),
pub passes: bool,
pub anti_benford_score: f64,
}Expand description
Results of Benford’s Law analysis.
Fields§
§sample_size: usizeNumber of samples analyzed.
observed_frequencies: [f64; 9]Observed first-digit frequencies (digits 1-9).
observed_counts: [u64; 9]Observed first-digit counts (digits 1-9).
expected_frequencies: [f64; 9]Expected Benford frequencies.
chi_squared: f64Chi-squared statistic.
degrees_of_freedom: u32Degrees of freedom (8).
p_value: f64P-value from chi-squared test.
mad: f64Mean Absolute Deviation from expected.
conformity: BenfordConformityConformity level based on MAD.
max_deviation: (u8, f64)Maximum deviation (digit index, deviation value).
passes: boolWhether test passes at the given significance level.
anti_benford_score: f64Anti-Benford score (0.0 = perfect Benford, 1.0 = anti-Benford).
Trait Implementations§
Source§impl Clone for BenfordAnalysis
impl Clone for BenfordAnalysis
Source§fn clone(&self) -> BenfordAnalysis
fn clone(&self) -> BenfordAnalysis
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Debug for BenfordAnalysis
impl Debug for BenfordAnalysis
Source§impl<'de> Deserialize<'de> for BenfordAnalysis
impl<'de> Deserialize<'de> for BenfordAnalysis
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Auto Trait Implementations§
impl Freeze for BenfordAnalysis
impl RefUnwindSafe for BenfordAnalysis
impl Send for BenfordAnalysis
impl Sync for BenfordAnalysis
impl Unpin for BenfordAnalysis
impl UnwindSafe for BenfordAnalysis
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.