blob: 17eab78f8208441438193c05f82672f5a1fe2c86 (
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
|
// Copyright 2012 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.
// Check that functions can modify local state.
fn sums_to(v: ~[int], sum: int) -> bool {
let mut i = 0u;
let mut sum0 = 0;
while i < v.len() {
sum0 += v[i];
i += 1u;
}
return sum0 == sum;
}
fn sums_to_using_uniq(v: ~[int], sum: int) -> bool {
let mut i = 0u;
let mut sum0 = ~0;
while i < v.len() {
*sum0 += v[i];
i += 1u;
}
return *sum0 == sum;
}
fn sums_to_using_rec(v: ~[int], sum: int) -> bool {
let mut i = 0u;
let mut sum0 = F {f: 0};
while i < v.len() {
sum0.f += v[i];
i += 1u;
}
return sum0.f == sum;
}
struct F<T> { f: T }
fn sums_to_using_uniq_rec(v: ~[int], sum: int) -> bool {
let mut i = 0u;
let mut sum0 = F {f: ~0};
while i < v.len() {
*sum0.f += v[i];
i += 1u;
}
return *sum0.f == sum;
}
pub fn main() {
}
|
