-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathgenerate.rs
254 lines (209 loc) · 5.21 KB
/
generate.rs
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
#[derive(Clone, Copy, Debug)]
pub struct Cursor {
pub index: usize,
pub count: usize,
}
impl Cursor {
pub fn new(index: usize, count: usize) -> Self {
Self { index, count }
}
}
pub struct Network {
order: usize,
cursor: Cursor,
}
impl Network {
pub fn new(order: usize) -> Self {
let groups = order;
let cursor = Cursor::new(0, groups);
Self { order, cursor }
}
pub fn order(&self) -> usize {
self.order
}
pub fn groups(&self) -> usize {
self.cursor.count
}
}
impl Iterator for Network {
type Item = Group;
fn next(&mut self) -> Option<Self::Item> {
if self.cursor.index >= self.cursor.count {
return None;
}
let length = 1 << self.order;
let index = self.cursor.index;
let blocks = 1 << (self.cursor.count - self.cursor.index - 1);
self.cursor.index += 1;
Some(Group::new(length, index, blocks))
}
}
#[derive(Clone, Debug)]
pub struct Group {
length: usize,
group_index: usize,
cursor: Cursor,
}
impl Group {
fn new(length: usize, group_index: usize, blocks: usize) -> Self {
let cursor = Cursor::new(0, blocks);
Self { length, group_index, cursor }
}
pub fn blocks(&self) -> usize {
self.cursor.count
}
}
impl Iterator for Group {
type Item = Block;
fn next(&mut self) -> Option<Self::Item> {
if self.cursor.index >= self.cursor.count {
return None;
}
let offset = self.cursor.index * (self.length / self.cursor.count);
self.cursor.index += 1;
Some(Block::new(offset, self.group_index))
}
}
#[derive(Clone, Debug)]
pub struct Block {
offset: usize,
group_index: usize,
cursor: Cursor,
}
impl Block {
fn new(offset: usize, group_index: usize) -> Self {
let stages = group_index + 1;
let cursor = Cursor::new(0, stages);
Self { offset, group_index, cursor }
}
pub fn stages(&self) -> usize {
self.cursor.count
}
}
impl Iterator for Block {
type Item = Stage;
fn next(&mut self) -> Option<Self::Item> {
if self.cursor.index >= self.cursor.count {
return None;
}
let stage_index = self.cursor.index;
let distance = 1 << (self.group_index - stage_index);
let offset = if stage_index == 0 {
self.offset
} else {
self.offset + distance
};
self.cursor.index += 1;
Some(Stage::new(self.group_index, stage_index, offset))
}
}
#[derive(Clone, Debug)]
pub struct Stage {
distance: usize,
offset: usize,
cursor: Cursor,
}
impl Stage {
fn new(group_index: usize, stage_index: usize, offset: usize) -> Self {
let mut patterns = 0;
let distance = 1 << (group_index - stage_index);
let mut i = 1 << (group_index + 1);
if stage_index > 0 {
i -= distance;
};
while i > distance {
patterns += 1;
i -= 2 * distance;
}
let cursor = Cursor::new(0, patterns);
Self { distance, offset, cursor }
}
pub fn patterns(&self) -> usize {
self.cursor.count
}
pub fn meta_pattern(&self) -> MetaPattern {
let start = self.offset;
let count = self.cursor.count;
let length = self.distance;
MetaPattern {
start,
count,
length,
}
}
pub fn distance(&self) -> usize {
self.distance * 2
}
}
impl Iterator for Stage {
type Item = Pattern;
fn next(&mut self) -> Option<Self::Item> {
if self.cursor.index >= self.cursor.count {
return None;
}
let offset = self.cursor.index * (2 * self.distance);
self.cursor.index += 1;
let min = self.offset + offset;
let max = min + self.distance;
let count = self.distance;
Some(Pattern::new(min, max, count))
}
}
#[derive(Clone, Debug)]
pub struct MetaPattern {
/// The first sub-pattern's lower index
pub start: usize,
/// The number of sub-patterns
pub count: usize,
/// The length of sub-patterns
pub length: usize,
}
#[derive(Clone, Debug)]
pub struct Pattern {
min: usize,
max: usize,
cursor: Cursor,
}
impl Pattern {
fn new(min: usize, max: usize, count: usize) -> Self {
let cursor = Cursor::new(0, count);
Self { min, max, cursor }
}
pub fn pairs(&self) -> usize {
self.cursor.count
}
}
impl Iterator for Pattern {
type Item = Pair;
fn next(&mut self) -> Option<Self::Item> {
if self.cursor.index >= self.cursor.count {
return None;
}
let offset = self.cursor.index;
self.cursor.index += 1;
let min = self.min + offset;
let max = self.max + offset;
Some(Pair::new(min, max))
}
}
#[derive(Clone, Debug)]
pub struct Pair {
/// Index of min element
pub min: usize,
/// Index of max element
pub max: usize,
}
impl Pair {
fn new(min: usize, max: usize) -> Self {
Self { min, max }
}
}
// #[cfg(test)]
// mod tests {
// use super::*;
//
// #[test]
// fn it_works() {
//
// }
// }