We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 5e8004d commit 7e0fa3fCopy full SHA for 7e0fa3f
src/libstd/list.rs
@@ -27,7 +27,7 @@ accumulated result.
27
* z - The initial value
28
* f - The function to apply
29
"]
30
-fn foldl<T: copy, U>(ls: list<U>, z: T, f: fn(T, U) -> T) -> T {
+fn foldl<T: copy, U>(z: T, ls: list<U>, f: fn(T, U) -> T) -> T {
31
let mut accum: T = z;
32
iter(ls) {|elt| accum = f(accum, elt);}
33
accum
@@ -180,8 +180,8 @@ mod tests {
180
fn add(&&a: uint, &&b: int) -> uint { ret a + (b as uint); }
181
let l = from_vec([0, 1, 2, 3, 4]);
182
let empty = list::nil::<int>;
183
- assert (list::foldl(l, 0u, add) == 10u);
184
- assert (list::foldl(empty, 0u, add) == 0u);
+ assert (list::foldl(0u, l, add) == 10u);
+ assert (list::foldl(0u, empty, add) == 0u);
185
}
186
187
#[test]
@@ -190,7 +190,7 @@ mod tests {
190
a - b
191
192
let l = from_vec([1, 2, 3, 4]);
193
- assert (list::foldl(l, 0, sub) == -10);
+ assert (list::foldl(0, l, sub) == -10);
194
195
196
0 commit comments