rw_cell/mpsc.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 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314
//!Implements the pattern "multiple producer single consumer"
//!
//! # Example
//!
//!```
//!
//! let (w0, mut r) = rw_cell::mpsc::new("Not good, but ok");
//! let w1 = r.writer();
//! let w2 = w0.clone();
//!
//! assert_eq!(r.read_with_is_new(), (&"Not good, but ok", false));
//!
//! w0.write("Not good");
//! assert_eq!(r.read_with_is_new(), (&"Not good", true));
//!
//! w1.write("ok");
//! assert_eq!(r.read(), &"ok");
//!
//! w2.write("But!!!");
//! assert_eq!(r.read(), &"But!!!");
//! ```
use std::sync::Arc;
use crate::option::OptionCell;
/// Struct for write data in cell with non-copy and non-lock
#[derive(Clone)]
pub struct Writer<T> {
cell: Arc<OptionCell<T>>
}
impl<T> Writer<T> {
fn new(cell: Arc<OptionCell<T>>) -> Self {
Self {
cell,
}
}
/// Write value in cell
///
/// # Examples
///
/// ```
/// let (w, mut r) = rw_cell::mpsc::new("Not good");
/// w.write("Good");
///
/// assert_eq!(r.read(), &"Good");
/// ```
pub fn write(&self, val: T) {
self.cell.replace(val);
}
}
/// Struct for read data from cell with non-copy and non-lock
pub struct Reader<T> {
cell: Arc<OptionCell<T>>,
val: T
}
impl<T> Reader<T> {
fn new(cell: Arc<OptionCell<T>>) -> Self {
Self {
val: cell.take().unwrap(),
cell,
}
}
/// Return [`Writer`] for write data in cell
pub fn writer(&self) -> Writer<T> {
Writer::new(self.cell.clone())
}
/// Returns a tuple of value references and a boolean value, whether new or not
///
/// # Examples
///
/// ```
/// let (w, mut r) = rw_cell::mpsc::new("Not good");
/// assert_eq!(r.read_with_is_new(), (&"Not good", false));
///
/// w.write("But ok");
/// assert_eq!(r.read_with_is_new(), (&"But ok", true));
/// ```
pub fn read_with_is_new(&mut self) -> (&T, bool) {
match self.cell.take() {
None => (&self.val, false),
Some(val) => {
self.val = val;
(&self.val, true)
}
}
}
/// Return a reference to the value from the cell
pub fn read(&mut self) -> &T {
match self.cell.take() {
None => &self.val,
Some(val) => {
self.val = val;
&self.val
}
}
}
}
/// Create new cell with [`Writer`] and [`Reader`]
///
/// # Examples
///
/// ```
/// let (w, mut r) = rw_cell::mpsc::new("Not good");
/// assert_eq!(r.read(), &"Not good");
///
/// w.write("But ok");
/// assert_eq!(r.read_with_is_new(), (&"But ok", true));
/// ```
pub fn new<T>(val: T) -> (Writer<T>, Reader<T>) {
let cell = Arc::new(OptionCell::new(val));
(Writer::new(cell.clone()), Reader::new(cell))
}
pub fn default<T>() -> (Writer<T>, Reader<T>)
where
T: Default
{
let cell = Arc::new(OptionCell::new(T::default()));
(Writer::new(cell.clone()), Reader::new(cell))
}
#[cfg(test)]
mod test {
use crate::mpsc;
#[test]
fn test_read() {
let (w, mut r) = mpsc::new(vec!["fffff"; 1000]);
assert_eq!(r.read(), &vec!["fffff"; 1000]);
w.write(vec!["Not good, but ok"]);
assert_eq!(r.read(), &vec!["Not good, but ok"]);
}
#[test]
fn test_read_with_is_new() {
let (w, mut r) = mpsc::new(vec!["fffff"; 1000]);
assert_eq!(r.read_with_is_new(), (&vec!["fffff"; 1000], false));
w.write(vec!["Not good"]);
assert_eq!(r.read_with_is_new(), (&vec!["Not good"], true));
}
#[test]
fn is_work() {
let (w0, mut r) = mpsc::new(vec!["Ukraine"; 1000]);
let w1 = r.writer();
let w2 = r.writer();
let w3 = r.writer();
let w4 = r.writer();
let w5 = r.writer();
std::thread::spawn(move || loop {
w0.write(vec!["Slovakia"; 1001])
});
std::thread::spawn(move || loop {
w1.write(vec!["Estonia"; 1002])
});
std::thread::spawn(move || loop {
w2.write(vec!["Czechia"; 1003])
});
std::thread::spawn(move || loop {
w3.write(vec!["United Kingdom"; 1004])
});
std::thread::spawn(move || loop {
w4.write(vec!["Lithuania"; 1004])
});
std::thread::spawn(move || loop {
w5.write(vec!["Latvia"; 1004])
});
let mut slovakia = 0;
let mut estonia = 0;
let mut czechia = 0;
let mut united_kingdom = 0;
let mut lithuania = 0;
let mut latvia = 0;
let mut ukraine = 0;
for _ in 0..10000000usize {
match r.read() {
val if val.first() == Some(&"Slovakia") => slovakia += 1,
val if val.first() == Some(&"Estonia") => estonia += 1,
val if val.first() == Some(&"Czechia") => czechia += 1,
val if val.first() == Some(&"United Kingdom") => united_kingdom += 1,
val if val.first() == Some(&"Lithuania") => lithuania += 1,
val if val.first() == Some(&"Latvia") => latvia += 1,
val if val.first() == Some(&"Ukraine") => ukraine += 1,
val => println!("val: {:?}, Not good, but ok", val.first())
}
}
println!("count Slovakia: {}", slovakia);
println!("count Estonia: {}", estonia);
println!("count Czechia: {}", czechia);
println!("count United Kingdom: {}", united_kingdom);
println!("count Lithuania: {}", lithuania);
println!("count Latvia: {}", latvia);
println!("count Ukraine: {}", ukraine);
}
// #[test]
// fn test() {
// let read_count = 1_000_000usize;
//
// let rw_cell_avg_time = test_rw_cell(read_count);
// let rw_lock_avg_time = test_rwlock(read_count);
//
// println!("rw_cell_avg_time: {rw_cell_avg_time}");
// println!("rw_lock_avg_time: {rw_lock_avg_time}");
// }
//
// fn test_rwlock(read_count: usize) -> u128 {
// let lock_cell0 = Arc::new(RwLock::new(vec!["fffff"; 1000]));
//
// let lock_cell1 = lock_cell0.clone();
// let lock_cell2 = lock_cell0.clone();
// let lock_cell3 = lock_cell0.clone();
// let lock_cell4 = lock_cell0.clone();
// let lock_cell5 = lock_cell0.clone();
// let lock_cell6 = lock_cell0.clone();
//
// std::thread::spawn(move || loop {
// *lock_cell0.write().unwrap() = vec!["fffff"; 1001];
// });
//
// std::thread::spawn(move || loop {
// *lock_cell1.write().unwrap() = vec!["fffff"; 1002]
// });
//
// std::thread::spawn(move || loop {
// *lock_cell2.write().unwrap() = vec!["fffff"; 1003]
// });
//
// std::thread::spawn(move || loop {
// *lock_cell3.write().unwrap() = vec!["fffff"; 1004]
// });
//
// std::thread::spawn(move || loop {
// *lock_cell4.write().unwrap() = vec!["fffff"; 1005]
// });
//
// std::thread::spawn(move || loop {
// *lock_cell5.write().unwrap() = vec!["fffff"; 1006]
// });
//
// let mut times = vec![];
//
// for _ in 0..read_count {
// let st = Instant::now();
// lock_cell6.read().unwrap().len();
// times.push(st.elapsed().as_nanos());
// }
// times.into_iter().sum::<u128>() / read_count as u128
// }
//
// fn test_rw_cell(read_count: usize) -> u128 {
// let (w0, mut r) = mwsr::cell(vec!["fffff"; 1000]);
//
// let w1 = w0.clone();
// let w2 = w0.clone();
// let w3 = w0.clone();
// let w4 = w0.clone();
// let w5 = w0.clone();
//
// std::thread::spawn(move || loop {
// w0.write(vec!["fffff"; 1001])
// });
//
// std::thread::spawn(move || loop {
// w1.write(vec!["fffff"; 1002])
// });
//
// std::thread::spawn(move || loop {
// w2.write(vec!["fffff"; 1003])
// });
//
// std::thread::spawn(move || loop {
// w3.write(vec!["fffff"; 1004])
// });
//
// std::thread::spawn(move || loop {
// w4.write(vec!["fffff"; 1005])
// });
//
// std::thread::spawn(move || loop {
// w5.write(vec!["fffff"; 1006])
// });
//
// let mut times = vec![];
//
// for _ in 0..read_count {
// let st = Instant::now();
// r.read().len();
// times.push(st.elapsed().as_nanos());
// }
//
// times.into_iter().sum::<u128>() / read_count as u128
// }
}