1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
//! Cross-sectional neutralization & industry grouping ops.
//! `neutralize` runs a per-date OLS and returns residuals; the industry ops
//! reduce to per-date group arithmetic (see each method).
use crate::align::align;
use crate::ops::linalg::solve_ols;
use crate::panel::{bool_to_f64, Panel};
use ndarray::Array2;
use std::collections::HashMap;
impl Panel {
/// Reindex another panel's values onto `self`'s exact (dates, symbols) grid,
/// NaN where a cell is absent. Lets per-row ops assume a shared axis.
pub(crate) fn project_onto(&self, dates: &[i32], symbols: &[String]) -> Array2<f64> {
let row_of: HashMap<i32, usize> = self
.dates
.iter()
.enumerate()
.map(|(i, &d)| (d, i))
.collect();
let col_of: HashMap<&str, usize> = self
.symbols
.iter()
.enumerate()
.map(|(i, s)| (s.as_str(), i))
.collect();
let mut out = Array2::from_elem((dates.len(), symbols.len()), f64::NAN);
for (r, d) in dates.iter().enumerate() {
let Some(&sr) = row_of.get(d) else { continue };
for (c, s) in symbols.iter().enumerate() {
if let Some(&sc) = col_of.get(s.as_str()) {
out[[r, c]] = self.data[[sr, sc]];
}
}
}
out
}
/// `neutralize`: per date, OLS-regress the factor on `neutralizers`
/// (plus an intercept when `add_const`), return residuals. A date is all-NaN
/// when fewer than `neutralizers.len() + 1` cells are valid across the factor
/// and every neutralizer.
pub fn neutralize(&self, neutralizers: &[Panel], add_const: bool) -> Panel {
// Project every neutralizer onto self's grid (align first so a differing
// axis still resolves by label, then snap to self's exact grid).
let projected: Vec<Array2<f64>> = neutralizers
.iter()
.map(|n| {
let (_, n2) = align(self, n);
n2.project_onto(&self.dates, &self.symbols)
})
.collect();
let (nrows, ncols) = self.data.dim();
let nfac = neutralizers.len();
let mut out = Array2::from_elem((nrows, ncols), f64::NAN);
let kcols = nfac + usize::from(add_const);
for r in 0..nrows {
// valid columns: factor and every neutralizer present
let valid: Vec<usize> = (0..ncols)
.filter(|&c| {
self.data[[r, c]].is_finite() && projected.iter().all(|p| p[[r, c]].is_finite())
})
.collect();
if valid.len() < nfac + 1 {
continue; // row stays NaN
}
let m = valid.len();
let mut x = Array2::<f64>::zeros((m, kcols));
let mut y = vec![0.0f64; m];
for (i, &c) in valid.iter().enumerate() {
let mut k = 0;
if add_const {
x[[i, 0]] = 1.0;
k = 1;
}
for (f, p) in projected.iter().enumerate() {
x[[i, k + f]] = p[[r, c]];
}
y[i] = self.data[[r, c]];
}
let Some(beta) = solve_ols(&x, &y) else {
continue;
};
for (i, &c) in valid.iter().enumerate() {
let mut fitted = 0.0;
for j in 0..kcols {
fitted += x[[i, j]] * beta[j];
}
out[[r, c]] = y[i] - fitted;
}
}
Panel {
dates: self.dates.clone(),
symbols: self.symbols.clone(),
data: out,
}
}
/// Group `valid_cols` by their industry. Columns missing from `industry`
/// fall into "其他" (the default "other" bucket) —
/// but for US single-sector data every tracked symbol has a sector.
/// Returns groups in first-seen column order (stable).
pub(crate) fn group_cols_by_industry<'a>(
&self,
industry: &'a HashMap<String, String>,
valid_cols: &[usize],
) -> Vec<(&'a str, Vec<usize>)> {
const OTHER: &str = "其他";
let mut order: Vec<&str> = Vec::new();
let mut groups: HashMap<&str, Vec<usize>> = HashMap::new();
for &c in valid_cols {
let cat = industry
.get(&self.symbols[c])
.map(String::as_str)
.unwrap_or(OTHER);
groups.entry(cat).or_insert_with(|| {
order.push(cat);
Vec::new()
});
groups.get_mut(cat).unwrap().push(c);
}
order
.into_iter()
.map(|cat| (cat, groups.remove(cat).unwrap()))
.collect()
}
/// `neutralize_industry`: residual of regressing the factor on industry
/// dummies. That residual is algebraically the within-industry demean, so we
/// compute it directly. A date is all-NaN when fewer than 2 cells are valid or
/// fewer than 2 distinct industries are present.
/// ponytail: industry-dummy OLS residual == within-group demean for any
/// `add_const`; `add_const` is kept for API parity but does not change values.
pub fn neutralize_industry(
&self,
industry: &HashMap<String, String>,
_add_const: bool,
) -> Panel {
let (nrows, ncols) = self.data.dim();
let mut out = Array2::from_elem((nrows, ncols), f64::NAN);
for r in 0..nrows {
let valid: Vec<usize> = (0..ncols)
.filter(|&c| self.data[[r, c]].is_finite())
.collect();
if valid.len() < 2 {
continue;
}
let groups = self.group_cols_by_industry(industry, &valid);
if groups.len() < 2 {
continue;
}
for (_, cols) in &groups {
let mean = cols.iter().map(|&c| self.data[[r, c]]).sum::<f64>() / cols.len() as f64;
for &c in cols {
out[[r, c]] = self.data[[r, c]] - mean;
}
}
}
Panel {
dates: self.dates.clone(),
symbols: self.symbols.clone(),
data: out,
}
}
/// `industry_rank`: per date, percentile-rank within each industry
/// (pandas `rank(pct=True)`, average ties → `avg_rank / group_size`). When
/// `categories` is `Some`, only those industries are ranked; every other
/// symbol (and any NaN cell) is NaN.
pub fn industry_rank(
&self,
industry: &HashMap<String, String>,
categories: Option<&[String]>,
) -> Panel {
let (nrows, ncols) = self.data.dim();
let allow = |cat: &str| categories.is_none_or(|cs| cs.iter().any(|c| c == cat));
let mut out = Array2::from_elem((nrows, ncols), f64::NAN);
for r in 0..nrows {
let valid: Vec<usize> = (0..ncols)
.filter(|&c| self.data[[r, c]].is_finite())
.collect();
for (cat, cols) in self.group_cols_by_industry(industry, &valid) {
if !allow(cat) {
continue;
}
let n = cols.len() as f64;
for &c in &cols {
let v = self.data[[r, c]];
// average rank: (#less + (#equal + 1)/2) ; pct = rank / n
let mut less = 0.0;
let mut equal = 0.0;
for &c2 in &cols {
let v2 = self.data[[r, c2]];
if v2 < v {
less += 1.0;
} else if v2 == v {
equal += 1.0;
}
}
out[[r, c]] = (less + (equal + 1.0) / 2.0) / n;
}
}
}
Panel {
dates: self.dates.clone(),
symbols: self.symbols.clone(),
data: out,
}
}
/// `groupby_category().<agg>()`: group columns by sector and aggregate
/// per date. Result columns are the sorted distinct sectors. NaN cells are
/// skipped; a group with no valid cell that date yields NaN. `std` is the
/// sample standard deviation (ddof=1), matching pandas.
pub fn groupby_category(
&self,
industry: &HashMap<String, String>,
agg: &str,
) -> Result<Panel, crate::error::EngineError> {
const OTHER: &str = "其他";
// sorted distinct categories present among self's symbols
let mut cats: Vec<String> = self
.symbols
.iter()
.map(|s| {
industry
.get(s)
.cloned()
.unwrap_or_else(|| OTHER.to_string())
})
.collect::<std::collections::BTreeSet<_>>()
.into_iter()
.collect();
cats.sort();
let cat_cols: Vec<Vec<usize>> = cats
.iter()
.map(|cat| {
(0..self.ncols())
.filter(|&c| {
industry
.get(&self.symbols[c])
.map(String::as_str)
.unwrap_or(OTHER)
== cat
})
.collect()
})
.collect();
let nrows = self.nrows();
let mut data = Array2::from_elem((nrows, cats.len()), f64::NAN);
for r in 0..nrows {
for (g, cols) in cat_cols.iter().enumerate() {
let vals: Vec<f64> = cols
.iter()
.map(|&c| self.data[[r, c]])
.filter(|v| v.is_finite())
.collect();
if vals.is_empty() {
continue;
}
data[[r, g]] = aggregate(agg, &vals)?;
}
}
Panel::new(self.dates.clone(), cats, data)
}
/// Boolean membership mask for a named sector: shape matches `self`
/// (dates × symbols). Cell is `1.0` when `industry[symbol]` **exactly**
/// equals `name`, else `0.0`. Symbols missing from the map are `0.0` (false)
/// so `mask(signal, in_sector(...))` drops them rather than propagating NaN.
/// Sector matching is case-sensitive.
pub fn in_sector(&self, industry: &HashMap<String, String>, name: &str) -> Panel {
let (nrows, ncols) = self.data.dim();
let mut data = Array2::from_elem((nrows, ncols), 0.0);
for c in 0..ncols {
let hit = industry
.get(&self.symbols[c])
.map(|s| s.as_str() == name)
.unwrap_or(false);
let v = bool_to_f64(hit);
for r in 0..nrows {
data[[r, c]] = v;
}
}
Panel {
dates: self.dates.clone(),
symbols: self.symbols.clone(),
data,
}
}
}
fn aggregate(agg: &str, vals: &[f64]) -> Result<f64, crate::error::EngineError> {
let n = vals.len() as f64;
Ok(match agg {
"sum" => vals.iter().sum(),
"mean" => vals.iter().sum::<f64>() / n,
"std" => {
if vals.len() < 2 {
return Ok(f64::NAN); // pandas std of one value is NaN (ddof=1)
}
let mean = vals.iter().sum::<f64>() / n;
let var = vals.iter().map(|v| (v - mean).powi(2)).sum::<f64>() / (n - 1.0);
var.sqrt()
}
other => {
return Err(crate::error::EngineError::Eval(format!(
"bad groupby agg '{other}'"
)));
}
})
}
#[cfg(test)]
mod in_sector_tests {
use super::*;
use ndarray::array;
#[test]
fn exact_match_false_for_missing_and_case() {
let p = Panel::new(
vec![20240102, 20240103],
vec!["AAPL".into(), "XOM".into(), "ZZZ".into()],
array![[1.0, 2.0, 3.0], [4.0, 5.0, 6.0]],
)
.unwrap();
let mut industry = HashMap::new();
industry.insert("AAPL".into(), "Technology".into());
industry.insert("XOM".into(), "Energy".into());
// ZZZ missing from map
let m = p.in_sector(&industry, "Technology");
assert_eq!(m.data[[0, 0]], 1.0);
assert_eq!(m.data[[1, 0]], 1.0); // constant over dates
assert_eq!(m.data[[0, 1]], 0.0);
assert_eq!(m.data[[0, 2]], 0.0); // missing → false
// case-sensitive
let m2 = p.in_sector(&industry, "technology");
assert_eq!(m2.data[[0, 0]], 0.0);
}
}