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
|
use std::iter::Iterator;
use std::ptr;
#[allow(non_camel_case_types)]
enum geng_iterator {}
extern "C" {
fn geng_iterator_create(
iter: *const *mut geng_iterator,
graph_size: usize,
batch_size: usize,
);
fn geng_iterator_next(iter: *const geng_iterator, g: *mut u32) -> bool;
fn printgraph(g: *const u32, n: usize);
}
fn print_graph(g: Vec<u32>, n: usize) {
unsafe {
printgraph(g.as_ptr(), n);
}
}
struct GengIterator {
pub size: usize,
iter: Box<geng_iterator>,
}
impl GengIterator {
fn new(n: usize) -> GengIterator {
let iter = unsafe {
let iter: *mut geng_iterator = ptr::null_mut();
geng_iterator_create(&iter, n, 100);
Box::from_raw(iter)
};
GengIterator { size: n, iter }
}
}
impl Iterator for &GengIterator {
type Item = Vec<u32>;
fn next(&mut self) -> Option<Self::Item> {
let mut g = vec![0; self.size];
let res;
unsafe {
let ptr: *const geng_iterator = &*self.iter;
res = geng_iterator_next(ptr, g.as_mut_ptr())
}
if res {
Some(g)
} else {
None
}
}
}
fn main() {
let gi = GengIterator::new(2);
// let q = gi.take(2).collect::<Vec<_>>();
// println!("{:?}", q);
// for i in q {
// print_graph(i, gi.size);
// }
for i in &gi {
print_graph(i, gi.size);
}
}
|
