@@ -99,14 +99,14 @@ fn foldr<A:copy,B,IA:iterable<A>>(
99
99
ret b;
100
100
}
101
101
102
- fn to_list < A : copy , IA : iterable < A > > ( self : IA ) -> [ A ] {
102
+ fn to_vec < A : copy , IA : iterable < A > > ( self : IA ) -> [ A ] {
103
103
foldl :: < A , [ A ] , IA > ( self , [ ] , { |r, a| r + [ a] } )
104
104
}
105
105
106
106
// FIXME: This could be made more efficient with an riterable interface
107
107
// #2005
108
108
fn reversed < A : copy , IA : iterable < A > > ( self : IA , blk : fn ( A ) ) {
109
- vec:: riter ( to_list ( self ) , blk)
109
+ vec:: riter ( to_vec ( self ) , blk)
110
110
}
111
111
112
112
fn count < A , IA : iterable < A > > ( self : IA , x : A ) -> uint {
@@ -167,17 +167,17 @@ fn test_enumerate() {
167
167
}
168
168
169
169
#[ test]
170
- fn test_map_and_to_list ( ) {
170
+ fn test_map_and_to_vec ( ) {
171
171
let a = bind vec:: iter ( [ 0 , 1 , 2 ] , _) ;
172
172
let b = bind map( a, { |i| 2 * i} , _) ;
173
- let c = to_list ( b) ;
173
+ let c = to_vec ( b) ;
174
174
assert c == [ 0 , 2 , 4 ] ;
175
175
}
176
176
177
177
#[ test]
178
178
fn test_map_directly_on_vec ( ) {
179
179
let b = bind map( [ 0 , 1 , 2 ] , { |i| 2 * i} , _) ;
180
- let c = to_list ( b) ;
180
+ let c = to_vec ( b) ;
181
181
assert c == [ 0 , 2 , 4 ] ;
182
182
}
183
183
@@ -187,7 +187,7 @@ fn test_filter_on_int_range() {
187
187
ret ( i % 2 ) == 0 ;
188
188
}
189
189
190
- let l = to_list ( bind filter ( bind int:: range ( 0 , 10 , _) , is_even, _) ) ;
190
+ let l = to_vec ( bind filter ( bind int:: range ( 0 , 10 , _) , is_even, _) ) ;
191
191
assert l == [ 0 , 2 , 4 , 6 , 8 ] ;
192
192
}
193
193
@@ -197,7 +197,7 @@ fn test_filter_on_uint_range() {
197
197
ret ( i % 2 u) == 0 u;
198
198
}
199
199
200
- let l = to_list ( bind filter ( bind uint:: range ( 0 u, 10 u, _) , is_even, _) ) ;
200
+ let l = to_vec ( bind filter ( bind uint:: range ( 0 u, 10 u, _) , is_even, _) ) ;
201
201
assert l == [ 0 u, 2 u, 4 u, 6 u, 8 u] ;
202
202
}
203
203
@@ -211,7 +211,7 @@ fn test_filter_map() {
211
211
}
212
212
}
213
213
214
- let l = to_list ( bind filter_map (
214
+ let l = to_vec ( bind filter_map (
215
215
bind int:: range ( 0 , 5 , _) , negativate_the_evens, _) ) ;
216
216
assert l == [ 0 , -2 , -4 ] ;
217
217
}
@@ -225,7 +225,7 @@ fn test_flat_map_with_option() {
225
225
226
226
let a = bind vec:: iter ( [ 0 , 1 , 2 ] , _) ;
227
227
let b = bind flat_map ( a, if_even, _) ;
228
- let c = to_list ( b) ;
228
+ let c = to_vec ( b) ;
229
229
assert c == [ 0 , 2 ] ;
230
230
}
231
231
@@ -239,7 +239,7 @@ fn test_flat_map_with_list() {
239
239
240
240
let a = bind vec:: iter ( [ 0 , 1 , 2 , 3 ] , _) ;
241
241
let b = bind flat_map ( a, repeat, _) ;
242
- let c = to_list ( b) ;
242
+ let c = to_vec ( b) ;
243
243
#debug[ "c = %?" , c] ;
244
244
assert c == [ 1 , 2 , 2 , 3 , 3 , 3 ] ;
245
245
}
@@ -281,7 +281,7 @@ fn test_max_empty() {
281
281
282
282
#[ test]
283
283
fn test_reversed ( ) {
284
- assert to_list ( bind reversed ( [ 1 , 2 , 3 ] , _) ) == [ 3 , 2 , 1 ] ;
284
+ assert to_vec ( bind reversed ( [ 1 , 2 , 3 ] , _) ) == [ 3 , 2 , 1 ] ;
285
285
}
286
286
287
287
#[ test]
0 commit comments