1pub mod align;
2pub mod arcdiagram;
3pub mod bin;
4pub mod bin2d;
5pub mod bindot;
6pub mod binhex;
7pub mod boxplot;
8pub mod calendar;
9pub mod chord;
10#[cfg(feature = "ggpubr")]
11pub mod compare_means;
12pub mod connect;
13pub mod contour;
14pub mod contour_filled;
15#[cfg(feature = "ggpubr")]
16pub mod cor;
17pub mod count;
18pub mod density;
19pub mod density2d;
20pub mod dist;
21pub mod distribution;
22pub mod ecdf;
23pub mod ellipse;
24pub mod function;
25pub mod funnel;
26pub(crate) mod gam;
27pub mod hclust;
28pub mod heikin_ashi;
29pub mod identity;
30pub mod indicator;
31pub mod loess;
32pub mod manual;
33pub mod marching_squares;
34pub mod marimekko;
35pub mod network;
36pub mod pack;
37pub mod pareto;
38pub mod partition;
39pub mod qq;
40#[cfg(feature = "regression")]
41pub mod quantile;
42pub mod renko;
43pub mod sankey;
44#[cfg(feature = "sf")]
45pub mod sf_coordinates;
46pub mod smooth;
47pub mod sum;
48pub mod summary;
49pub mod summary2d;
50pub mod summary_bin;
51pub mod tree;
52pub mod treemap;
53pub mod unique;
54pub mod venn;
55pub mod waffle;
56pub mod waterfall;
57pub mod xdensity_ridges;
58pub mod ydensity;
59
60use crate::aes::{Aes, Aesthetic};
61use crate::data::DataFrame;
62use crate::scale::ScaleSet;
63
64pub trait Stat: Send + Sync {
66 fn compute_group(&self, data: &DataFrame, scales: &ScaleSet) -> DataFrame;
68
69 fn required_aes(&self) -> Vec<Aesthetic>;
71
72 fn default_aes(&self) -> Aes {
74 Aes::default()
75 }
76
77 fn panelwise(&self) -> bool {
82 false
83 }
84
85 fn computed_y(&self) -> bool {
89 false
90 }
91
92 fn name(&self) -> &str;
94
95 fn validate(&self, _warnings: &mut Vec<String>) {}
103}
104
105pub(crate) fn bw_nrd0(values: &[f64]) -> f64 {
109 let n = values.len();
110 if n < 2 {
111 return 1.0;
112 }
113 let nf = n as f64;
114 let mean = values.iter().sum::<f64>() / nf;
115 let sd = (values.iter().map(|x| (x - mean).powi(2)).sum::<f64>() / (nf - 1.0)).sqrt();
116 let mut sorted = values.to_vec();
117 sorted.sort_by(|a, b| a.total_cmp(b));
118 let q = |p: f64| {
119 let h = (n - 1) as f64 * p;
120 let lo = h.floor() as usize;
121 let hi = (lo + 1).min(n - 1);
122 sorted[lo] + (h - lo as f64) * (sorted[hi] - sorted[lo])
123 };
124 let iqr = q(0.75) - q(0.25);
125 let mut lo = sd.min(iqr / 1.34);
126 for fallback in [sd, values[0].abs(), 1.0] {
127 if lo > 0.0 && lo.is_finite() {
128 break;
129 }
130 lo = fallback;
131 }
132 0.9 * lo * nf.powf(-0.2)
133}