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
use{
crate::{
*,
glue::derivative::*
},
rayon::prelude::*,
};
pub(crate) fn only_merged<Hist>(
merge_points: Vec<usize>,
alignment: Vec<usize>,
log_prob: Vec<Vec<f64>>,
e_hist: Hist
) -> (Vec<f64>, Hist)
where Hist: Histogram
{
let mut merged_log_prob = vec![f64::NAN; e_hist.bin_count()];
if merge_points.is_empty() {
merged_log_prob = log_prob.into_iter().next().unwrap();
norm_ln_prob(&mut merged_log_prob);
return (merged_log_prob, e_hist);
}
merged_log_prob[..=merge_points[0]]
.copy_from_slice(&log_prob[0][..=merge_points[0]]);
let mut align_sum = 0;
for (index, (&a, &mp)) in alignment.iter().zip(merge_points.iter()).enumerate()
{
let position_l = mp + align_sum;
align_sum += a;
let left = mp - a;
let shift = merged_log_prob[position_l] - log_prob[index + 1][left];
merged_log_prob[position_l..]
.iter_mut()
.zip(log_prob[index + 1][left..].iter())
.for_each(
|(merge, val)|
{
*merge = val + shift;
}
);
}
norm_ln_prob(&mut merged_log_prob);
(merged_log_prob, e_hist)
}
pub(crate) fn merged_and_aligned<'a, Hist: 'a, I>(
hists: I,
merge_points: Vec<usize>,
alignment: Vec<usize>,
log_prob: Vec<Vec<f64>>,
e_hist: Hist
) -> GluedResult<Hist>
where Hist: HistogramCombine + Histogram,
I: Iterator<Item = &'a Hist>
{
if log_prob.is_empty() {
return Err(HistErrors::EmptySlice);
}
let mut merged_log_prob = vec![f64::NAN; e_hist.bin_count()];
let mut aligned_intervals = vec![merged_log_prob.clone(); alignment.len() + 1];
aligned_intervals[0][..log_prob[0].len()]
.copy_from_slice(&log_prob[0]);
if merge_points.is_empty() {
norm_ln_prob(&mut aligned_intervals[0]);
merged_log_prob.copy_from_slice(&aligned_intervals[0]);
return Ok(
(e_hist, merged_log_prob, aligned_intervals)
);
}
merged_log_prob[..=merge_points[0]]
.copy_from_slice(&log_prob[0][..=merge_points[0]]);
let mut align_sum = 0;
for ((index, (&a, &mp)), hist) in alignment.iter()
.zip(merge_points.iter()).enumerate()
.zip(
hists.skip(1)
)
{
let position_l = mp + align_sum;
align_sum += a;
let left = mp - a;
let index_p1 = index + 1;
let shift = merged_log_prob[position_l] - log_prob[index_p1][left];
let unmerged_align = e_hist.align(hist)?;
aligned_intervals[index_p1][unmerged_align..]
.iter_mut()
.zip(log_prob[index_p1].iter())
.for_each(|(v, &val)| *v = val + shift);
merged_log_prob[position_l..]
.iter_mut()
.zip(log_prob[index_p1][left..].iter())
.for_each(
|(merge, val)|
{
*merge = val + shift;
}
);
}
let shift = norm_ln_prob(&mut merged_log_prob);
aligned_intervals.par_iter_mut()
.for_each(
|interval|
interval.iter_mut()
.for_each(|val| *val += shift)
);
Ok(
(e_hist, merged_log_prob, aligned_intervals)
)
}
#[allow(clippy::type_complexity)]
pub(crate) fn align<Hist>(container: &[(&[f64], &Hist)]) -> Result<(Vec<usize>, Vec<usize>, Vec<Vec<f64>>, Hist), HistErrors>
where Hist: HistogramCombine + Send + Sync
{
let hists: Vec<_> = container.iter()
.map(|v| v.1)
.collect();
let e_hist = Hist::encapsulating_hist(&hists)?;
let derivatives: Vec<_> = container.par_iter()
.map(|v| derivative_merged(v.0))
.collect();
let alignment = hists.iter()
.zip(hists.iter().skip(1))
.map(|(&left, &right)| left.align(right))
.collect::<Result<Vec<_>, _>>()?;
let merge_points = calc_merge_points(&alignment, &derivatives);
let log_prob = container.iter()
.map(|v| v.0.into())
.collect();
Ok(
(
merge_points,
alignment,
log_prob,
e_hist
)
)
}