Compute number of concurrent events for each timestamp.
(
close_index: &[NaiveDateTime],
label_endtime: &[(NaiveDateTime, NaiveDateTime)],
)
| 4 | |
| 5 | /// Compute number of concurrent events for each timestamp. |
| 6 | fn num_concurrent_events( |
| 7 | close_index: &[NaiveDateTime], |
| 8 | label_endtime: &[(NaiveDateTime, NaiveDateTime)], |
| 9 | ) -> BTreeMap<NaiveDateTime, usize> { |
| 10 | let mut counts: BTreeMap<NaiveDateTime, usize> = BTreeMap::new(); |
| 11 | for (start, end) in label_endtime { |
| 12 | for ts in close_index.iter().filter(|ts| **ts >= *start && **ts <= *end) { |
| 13 | *counts.entry(*ts).or_insert(0) += 1; |
| 14 | } |
| 15 | } |
| 16 | counts |
| 17 | } |
| 18 | |
| 19 | /// Average uniqueness from triple barrier events. |
| 20 | #[allow(dead_code)] |
no outgoing calls
no test coverage detected