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