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
//! A lock-free multi-producer multi-consumer unbounded queue.
//!
//! # Examples
//!
//! Single Producer - Single Consumer:
//!
//! ```
//! use lf_queue::Queue;
//!
//! const COUNT: usize = 1_000;
//! let queue: Queue<usize> = Queue::new();
//!
//! for i in 0..COUNT {
//! queue.push(i);
//! }
//!
//! for i in 0..COUNT {
//! assert_eq!(i, queue.pop().unwrap());
//! }
//!
//! assert!(queue.pop().is_none());
//! ```
//! Multi Producer - Single Consumer:
//!
//! ```
//! use lf_queue::Queue;
//! use std::thread;
//!
//! const COUNT: usize = 1_000;
//! const CONCURRENCY: usize = 4;
//!
//! let queue: Queue<usize> = Queue::new();
//!
//! let ths: Vec<_> = (0..CONCURRENCY)
//! .map(|_| {
//! let q = queue.clone();
//! thread::spawn(move || {
//! for i in 0..COUNT {
//! q.push(i);
//! }
//! })
//! })
//! .collect();
//!
//! for th in ths {
//! th.join().unwrap();
//! }
//!
//! for _ in 0..COUNT * CONCURRENCY {
//! assert!(queue.pop().is_some());
//! }
//!
//! assert!(queue.pop().is_none());
//! ```
//!
//! Single Producer - Multi Consumer:
//!
//! ```
//! use lf_queue::Queue;
//! use std::thread;
//!
//! const COUNT: usize = 1_000;
//! const CONCURRENCY: usize = 4;
//!
//! let queue: Queue<usize> = Queue::new();
//!
//! for i in 0..COUNT * CONCURRENCY {
//! queue.push(i);
//! }
//!
//! let ths: Vec<_> = (0..CONCURRENCY)
//! .map(|_| {
//! let q = queue.clone();
//! thread::spawn(move || {
//! for _ in 0..COUNT {
//! loop {
//! if q.pop().is_some() {
//! break;
//! }
//! }
//! }
//! })
//! })
//! .collect();
//!
//! for th in ths {
//! th.join().unwrap();
//! }
//!
//! assert!(queue.pop().is_none());
//! ```
//!
//! Multi Producer - Multi Consumer:
//!
//! ```
//! use lf_queue::Queue;
//! use std::sync::atomic::{AtomicUsize, Ordering};
//! use std::sync::Arc;
//! use std::thread;
//!
//! const COUNT: usize = 1_000;
//! const CONCURRENCY: usize = 4;
//!
//! let queue: Queue<usize> = Queue::new();
//! let items = Arc::new((0..COUNT).map(|_| AtomicUsize::new(0)).collect::<Vec<_>>());
//!
//! let ths: Vec<_> = (0..CONCURRENCY)
//! .map(|_| {
//! let q = queue.clone();
//! let its = items.clone();
//! thread::spawn(move || {
//! for _ in 0..COUNT {
//! let n = loop {
//! if let Some(x) = q.pop() {
//! break x;
//! } else {
//! thread::yield_now();
//! }
//! };
//! its[n].fetch_add(1, Ordering::SeqCst);
//! }
//! })
//! })
//! .map(|_| {
//! let q = queue.clone();
//! thread::spawn(move || {
//! for i in 0..COUNT {
//! q.push(i);
//! }
//! })
//! })
//! .collect();
//!
//! for th in ths {
//! th.join().unwrap();
//! }
//!
//! thread::sleep(std::time::Duration::from_millis(10));
//!
//! for c in &*items {
//! assert_eq!(c.load(Ordering::SeqCst), CONCURRENCY);
//! }
//!
//! assert!(queue.pop().is_none());
//! ```
pub
pub
pub
pub
pub use Queue;