blob: efccff75a49dd080ea0992ee7ef14b93bda85692 (
plain)
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
|
// 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.
#![feature(binary_heap_extras)]
use std::collections::BinaryHeap;
fn make_pq() -> BinaryHeap<isize> {
BinaryHeap::from_vec(vec![1,2,3])
}
pub fn main() {
let mut pq = make_pq();
let mut sum = 0;
while let Some(x) = pq.pop() {
sum += x;
}
assert_eq!(sum, 6);
pq = make_pq();
sum = 0;
'a: while let Some(x) = pq.pop() {
sum += x;
if x == 2 {
break 'a;
}
}
assert_eq!(sum, 5);
pq = make_pq();
sum = 0;
'a: while let Some(x) = pq.pop() {
if x == 3 {
continue 'a;
}
sum += x;
}
assert_eq!(sum, 3);
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;
}
}
assert_eq!(sum, 6 + 12 + 18);
}
|
