2018-08-30 14:18:55 +02:00
|
|
|
//@ run-pass
|
2018-09-25 23:51:35 +02:00
|
|
|
#![allow(unused_mut)]
|
|
|
|
#![allow(unused_assignments)]
|
2015-03-22 13:13:15 -07:00
|
|
|
|
2014-12-23 11:53:35 -08:00
|
|
|
use std::sync::mpsc::channel;
|
2014-12-22 09:04:23 -08:00
|
|
|
|
2024-08-24 05:32:52 +02:00
|
|
|
pub fn main() {
|
|
|
|
test00();
|
|
|
|
}
|
2010-07-28 16:58:17 -07:00
|
|
|
|
2011-04-19 13:35:49 -07:00
|
|
|
fn test00() {
|
2015-03-25 17:06:52 -07:00
|
|
|
let mut r: isize = 0;
|
|
|
|
let mut sum: isize = 0;
|
2014-03-09 14:58:32 -07:00
|
|
|
let (tx, rx) = channel();
|
|
|
|
let mut tx0 = tx.clone();
|
|
|
|
let mut tx1 = tx.clone();
|
|
|
|
let mut tx2 = tx.clone();
|
|
|
|
let mut tx3 = tx.clone();
|
2015-03-25 17:06:52 -07:00
|
|
|
let number_of_messages: isize = 1000;
|
|
|
|
let mut i: isize = 0;
|
2011-07-27 14:19:39 +02:00
|
|
|
while i < number_of_messages {
|
2014-12-23 11:53:35 -08:00
|
|
|
tx0.send(i + 0).unwrap();
|
|
|
|
tx1.send(i + 0).unwrap();
|
|
|
|
tx2.send(i + 0).unwrap();
|
|
|
|
tx3.send(i + 0).unwrap();
|
2010-07-28 16:58:17 -07:00
|
|
|
i += 1;
|
|
|
|
}
|
|
|
|
i = 0;
|
2011-07-27 14:19:39 +02:00
|
|
|
while i < number_of_messages {
|
2014-12-23 11:53:35 -08:00
|
|
|
r = rx.recv().unwrap();
|
2011-06-15 11:19:50 -07:00
|
|
|
sum += r;
|
2014-12-23 11:53:35 -08:00
|
|
|
r = rx.recv().unwrap();
|
2011-06-15 11:19:50 -07:00
|
|
|
sum += r;
|
2014-12-23 11:53:35 -08:00
|
|
|
r = rx.recv().unwrap();
|
2011-06-15 11:19:50 -07:00
|
|
|
sum += r;
|
2014-12-23 11:53:35 -08:00
|
|
|
r = rx.recv().unwrap();
|
2011-06-15 11:19:50 -07:00
|
|
|
sum += r;
|
2010-07-28 16:58:17 -07:00
|
|
|
i += 1;
|
|
|
|
}
|
2013-05-18 22:02:45 -04:00
|
|
|
assert_eq!(sum, 1998000);
|
2011-07-13 15:44:09 -07:00
|
|
|
// assert (sum == 4 * ((number_of_messages *
|
2010-08-09 06:53:37 -07:00
|
|
|
// (number_of_messages - 1)) / 2));
|
2011-08-19 15:16:48 -07:00
|
|
|
}
|