@@ -16,35 +16,35 @@ fn either[T, U,
16
16
}
17
17
}
18
18
19
- fn lefts[ T , U ] ( & vec [ t[ T , U ] ] eithers) -> vec [ T ] {
20
- let vec [ T ] result = [ ] ;
19
+ fn lefts[ T , U ] ( & ( t[ T , U ] ) [ ] eithers) -> T [ ] {
20
+ let T [ ] result = ~ [ ] ;
21
21
for ( t[ T , U ] elt in eithers) {
22
22
alt ( elt) {
23
- case ( left( ?l) ) { result += [ l] }
23
+ case ( left( ?l) ) { result += ~ [ l] }
24
24
case ( _) { /* fallthrough */ }
25
25
}
26
26
}
27
27
ret result;
28
28
}
29
29
30
- fn rights[ T , U ] ( & vec [ t[ T , U ] ] eithers) -> vec [ U ] {
31
- let vec [ U ] result = [ ] ;
30
+ fn rights[ T , U ] ( & ( t[ T , U ] ) [ ] eithers) -> U [ ] {
31
+ let U [ ] result = ~ [ ] ;
32
32
for ( t[ T , U ] elt in eithers) {
33
33
alt ( elt) {
34
- case ( right( ?r) ) { result += [ r] }
34
+ case ( right( ?r) ) { result += ~ [ r] }
35
35
case ( _) { /* fallthrough */ }
36
36
}
37
37
}
38
38
ret result;
39
39
}
40
40
41
- fn partition[ T , U ] ( & vec [ t[ T , U ] ] eithers) -> tup( vec [ T ] , vec [ U ] ) {
42
- let vec [ T ] lefts = [ ] ;
43
- let vec [ U ] rights = [ ] ;
41
+ fn partition[ T , U ] ( & ( t[ T , U ] ) [ ] eithers) -> tup( T [ ] , U [ ] ) {
42
+ let T [ ] lefts = ~ [ ] ;
43
+ let U [ ] rights = ~ [ ] ;
44
44
for ( t[ T , U ] elt in eithers) {
45
45
alt ( elt) {
46
- case ( left( ?l) ) { lefts += [ l] }
47
- case ( right( ?r) ) { rights += [ r] }
46
+ case ( left( ?l) ) { lefts += ~ [ l] }
47
+ case ( right( ?r) ) { rights += ~ [ r] }
48
48
}
49
49
}
50
50
ret tup( lefts, rights) ;
0 commit comments