Struct DigramAnalysis 

pub struct DigramAnalysis {
    pub chi2_a: f64,
    pub chi2_b: f64,
    pub sufficient_data: bool,
    pub min_sample_bytes: usize,
}

Digram (byte bigram) chi-squared uniformity.

Trigrams are intentionally omitted: hashing 16M possible trigrams into fewer bins produces systematic chi-squared bias from hash collisions, making the statistic unreliable. Digrams with 65536 exact bins are sound when the sample has >= ~320KB (expected count >= 5 per bin).

Fields

chi2_a: f64

Chi-squared statistic for digram uniformity, or NaN if insufficient data.

chi2_b: f64

Chi-squared statistic for digram uniformity, or NaN if insufficient data.

sufficient_data: bool

Whether the sample was large enough for the chi-squared approximation.

min_sample_bytes: usize

Minimum sample size needed (bytes) for expected >= 5 per bin.

Trait Implementations

impl Clone for DigramAnalysis

fn clone(&self) -> DigramAnalysis

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for DigramAnalysis

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

Formats the value using the given formatter.

impl Serialize for DigramAnalysis

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.