revenq 0.3.0

A concurrent, revision-based event queue implementation
Documentation 
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

fn main() {
    use revenq::Queue;
    use std::thread;

    loop {
        let spt = |mut q: Queue<u32>, publiv: Vec<u32>| {
            thread::spawn(move || {
                let mut c = Vec::new();
                let plvl = publiv.len();
                for i in publiv {
                    q.enqueue(i);
                }
                while c.len() < plvl {
                    q.print_debug(
                        std::io::stdout(),
                        &format!("{:?} |+", std::thread::current().id()),
                    )
                    .unwrap();
                    match futures_lite::future::block_on(q.next_async()) {
                        Some(x) => c.push(*x),
                        None => {
                            println!("{:?} | ouch; c = {:?}", std::thread::current().id(), c);
                            q.print_debug(
                                std::io::stdout(),
                                &format!("{:?} |+", std::thread::current().id()),
                            )
                            .unwrap();
                            panic!();
                        }
                    }
                }
                c.extend((&mut q).map(|i| *i));
                println!("{:?} | done; c = {:?}", std::thread::current().id(), c);
                q.print_debug(
                    std::io::stdout(),
                    &format!("{:?} |+", std::thread::current().id()),
                )
                .unwrap();
            })
        };

        let q1 = Queue::new();
        let q2 = q1.clone();
        let th1 = spt(q1, vec![1, 3]);
        let th2 = spt(q2, vec![2, 4]);
        th1.join().unwrap();
        th2.join().unwrap();
        println!();
    }
}