rust/src/test/run-pass/while-let.rs

55 lines
1.3 KiB
Rust
Raw Normal View History

2014-10-02 23:59:32 -05:00
// Copyright 2014 The Rust Project Developers. See the COPYRIGHT
// file at the top-level directory of this distribution and at
// http://rust-lang.org/COPYRIGHT.
//
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
// option. This file may not be copied, modified, or distributed
// except according to those terms.
use std::collections::BinaryHeap;
2014-10-02 23:59:32 -05:00
fn make_pq() -> BinaryHeap<int> {
2015-01-25 15:05:03 -06:00
BinaryHeap::from_vec(vec![1,2,3])
2014-10-02 23:59:32 -05:00
}
pub fn main() {
let mut pq = make_pq();
2015-01-25 15:05:03 -06:00
let mut sum = 0;
2014-10-02 23:59:32 -05:00
while let Some(x) = pq.pop() {
sum += x;
}
2015-01-25 15:05:03 -06:00
assert_eq!(sum, 6);
2014-10-02 23:59:32 -05:00
pq = make_pq();
sum = 0;
'a: while let Some(x) = pq.pop() {
sum += x;
if x == 2 {
break 'a;
}
}
2015-01-25 15:05:03 -06:00
assert_eq!(sum, 5);
2014-10-02 23:59:32 -05:00
pq = make_pq();
sum = 0;
'a: while let Some(x) = pq.pop() {
if x == 3 {
continue 'a;
}
sum += x;
}
2015-01-25 15:05:03 -06:00
assert_eq!(sum, 3);
2014-10-02 23:59:32 -05:00
let mut pq1 = make_pq();
sum = 0;
while let Some(x) = pq1.pop() {
let mut pq2 = make_pq();
while let Some(y) = pq2.pop() {
sum += x * y;
}
}
2015-01-25 15:05:03 -06:00
assert_eq!(sum, 6 + 12 + 18);
2014-10-02 23:59:32 -05:00
}