squiid/rust
1
0
Fork 0
Code Issues Pull requests Projects Activity

stdlib: Port std::either over to interior vectors

Browse source
This commit is contained in:
Patrick Walton 2011-07-12 14:27:46 -07:00
parent b062bbdb8e
commit ab579e1c9f
1 changed files with 11 additions and 11 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

22
src/lib/either.rs
View file

@ -16,35 +16,35 @@ fn either[T, U,
}
}
fn lefts[T, U](&vec[t[T, U]] eithers) -> vec[T] {
let vec[T] result = [];
fn lefts[T, U](&(t[T, U])[] eithers) -> T[] {
let T[] result = ~[];
for (t[T, U] elt in eithers) {
alt (elt) {
case (left(?l)) { result += [l] }
case (left(?l)) { result += ~[l] }
case (_) {/* fallthrough */ }
}
}
ret result;
}
fn rights[T, U](&vec[t[T, U]] eithers) -> vec[U] {
let vec[U] result = [];
fn rights[T, U](&(t[T, U])[] eithers) -> U[] {
let U[] result = ~[];
for (t[T, U] elt in eithers) {
alt (elt) {
case (right(?r)) { result += [r] }
case (right(?r)) { result += ~[r] }
case (_) {/* fallthrough */ }
}
}
ret result;
}
fn partition[T, U](&vec[t[T, U]] eithers) -> tup(vec[T], vec[U]) {
let vec[T] lefts = [];
let vec[U] rights = [];
fn partition[T, U](&(t[T, U])[] eithers) -> tup(T[], U[]) {
let T[] lefts = ~[];
let U[] rights = ~[];
for (t[T, U] elt in eithers) {
alt (elt) {
case (left(?l)) { lefts += [l] }
case (right(?r)) { rights += [r] }
case (left(?l)) { lefts += ~[l] }
case (right(?r)) { rights += ~[r] }
}
}
ret tup(lefts, rights);