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
|
use std::cmp::{self, Ordering};
use azalea_core::math::{EPSILON, gcd, lcm};
use super::CubePointRange;
#[derive(Debug)]
pub enum IndexMerger {
Identical {
coords: Box<[f64]>,
},
DiscreteCube {
result: CubePointRange,
first_div: u32,
second_div: u32,
},
NonOverlapping {
lower: Box<[f64]>,
upper: Box<[f64]>,
swap: bool,
},
Indirect {
result: Box<[f64]>,
first_indices: Box<[isize]>,
second_indices: Box<[isize]>,
result_length: usize,
},
}
impl IndexMerger {
pub fn get_list(&self) -> Box<[f64]> {
match self {
IndexMerger::Identical { coords } => coords.clone(),
IndexMerger::DiscreteCube { result, .. } => result.iter(),
IndexMerger::NonOverlapping { lower, upper, .. } => (0..self.size())
.map(|i| {
if i < lower.len() {
lower[i]
} else {
upper[i - lower.len()]
}
})
.collect(),
IndexMerger::Indirect {
result,
result_length,
..
} => {
if *result_length <= 1 {
Box::new([])
} else {
result[..*result_length].into()
}
}
}
}
pub fn for_merged_indexes(&self, mut consumer: impl IndexConsumer) -> bool {
match self {
IndexMerger::Identical { coords } => {
for coord in 0..(coords.len() - 1) {
if !consumer(coord as i32, coord as i32, coord as i32) {
return false;
}
}
true
}
IndexMerger::DiscreteCube {
result,
first_div,
second_div,
} => {
for var3 in 0..(result.size() - 1) {
if !consumer(
(var3 / second_div).try_into().unwrap(),
(var3 / first_div).try_into().unwrap(),
var3.try_into().unwrap(),
) {
return false;
}
}
true
}
IndexMerger::NonOverlapping { lower, upper, swap } => {
if *swap {
for_non_swapped_indexes(lower, upper, move |var1x, var2, var3| {
consumer(var2, var1x, var3)
})
} else {
for_non_swapped_indexes(lower, upper, consumer)
}
}
IndexMerger::Indirect {
first_indices,
second_indices,
result_length,
..
} => {
let var2 = result_length - 1;
for var3 in 0..var2 {
if !consumer(
first_indices[var3].try_into().unwrap(),
second_indices[var3].try_into().unwrap(),
var3.try_into().unwrap(),
) {
return false;
}
}
true
}
}
}
pub fn size(&self) -> usize {
match self {
IndexMerger::Identical { coords } => coords.len(),
IndexMerger::DiscreteCube { result, .. } => result.size().try_into().unwrap(),
IndexMerger::NonOverlapping { lower, upper, .. } => lower.len() + upper.len(),
IndexMerger::Indirect { result_length, .. } => *result_length,
}
}
pub fn new_discrete_cube(a: u32, b: u32) -> Self {
let result = CubePointRange {
parts: (u32::try_from(lcm(a, b)).expect("lcm should be able to fit in a u32"))
.try_into()
.expect("lcm should not be 0"),
};
let gcd = gcd(a, b);
let first_div = a / gcd;
let second_div = b / gcd;
Self::DiscreteCube {
result,
first_div,
second_div,
}
}
pub fn new_indirect(coords1: &[f64], coords2: &[f64], var3: bool, var4: bool) -> Self {
let mut var5 = f64::NAN;
let coords1_len = coords1.len();
let coords2_len = coords2.len();
let number_of_indices = coords1_len + coords2_len;
let mut result = Box::<[f64]>::from(vec![0.; number_of_indices]);
let mut first_indices = Box::<[isize]>::from(vec![0; number_of_indices]);
let mut second_indices = Box::<[isize]>::from(vec![0; number_of_indices]);
let var10 = !var3;
let var11 = !var4;
let mut var12 = 0;
let mut coords1_index = 0;
let mut coords2_index = 0;
loop {
let mut iterating_coords1: bool;
loop {
let at_end_of_coords1 = coords1_index >= coords1_len;
let at_end_of_coords2 = coords2_index >= coords2_len;
if at_end_of_coords1 && at_end_of_coords2 {
let result_length = cmp::max(1, var12);
return Self::Indirect {
result,
first_indices,
second_indices,
result_length,
};
}
iterating_coords1 = !at_end_of_coords1
&& (at_end_of_coords2
|| coords1[coords1_index] < coords2[coords2_index] + EPSILON);
if iterating_coords1 {
coords1_index += 1;
if !var10 || coords2_index != 0 && !at_end_of_coords2 {
break;
}
} else {
coords2_index += 1;
if !var11 || coords1_index != 0 && !at_end_of_coords1 {
break;
}
}
}
let var18: isize = (coords1_index as isize) - 1;
let var19: isize = (coords2_index as isize) - 1;
let var20 = if iterating_coords1 {
coords1[usize::try_from(var18).unwrap()]
} else {
coords2[usize::try_from(var19).unwrap()]
};
match var5.partial_cmp(&(var20 - EPSILON)) {
None | Some(Ordering::Less) => {
result[var12] = var20;
first_indices[var12] = var18;
second_indices[var12] = var19;
var12 += 1;
var5 = var20;
}
_ => {
first_indices[var12 - 1] = var18;
second_indices[var12 - 1] = var19;
}
}
}
}
}
pub trait IndexConsumer = FnMut(i32, i32, i32) -> bool;
fn for_non_swapped_indexes(lower: &[f64], upper: &[f64], mut consumer: impl IndexConsumer) -> bool {
let var2 = lower.len();
for var3 in 0..var2 {
if !consumer(var3.try_into().unwrap(), -1, var3.try_into().unwrap()) {
return false;
}
}
let var3 = upper.len() - 1;
for var4 in 0..var3 {
if !consumer(
(var2 - 1).try_into().unwrap(),
var4.try_into().unwrap(),
(var2 + var4).try_into().unwrap(),
) {
return false;
}
}
true
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test_indirect_index_merger() {
IndexMerger::new_indirect(&[0.0, 1.0], &[0.0, 0.5, 1.0], true, true);
}
}
|
