Lines Matching defs:it
36 let it = a.chain(b); in chain() localVariable
42 let it = a.chain(b).rev(); in chain() localVariable
56 let it = Some(Ok(1)).into_iter().chain(iter::repeat(Err(()))); in count() localVariable
62 let it = convert(vec![5, 6, 7, 8].into_iter().map(Ok::<u32, ()>)).enumerate(); in enumerate() localVariable
72 let it = convert(vec![0, 1, 2, 3].into_iter().map(Ok::<u32, u32>)); in filter() localVariable
73 let it = it.filter(|&x| if x % 2 == 0 { Ok(x % 3 == 0) } else { Err(x) }); in filter() localVariable
78 let it = convert(vec![0, 2, 4, 6].into_iter().map(Ok::<u32, u32>)); in filter() localVariable
79 let it = it.filter(|&x| if x % 2 == 0 { Ok(x % 3 == 0) } else { Err(x) }); in filter() localVariable
97 let it = convert(vec![0, 1, 2, 3, 4, 5, 6].into_iter().map(Ok::<u32, u32>)) in filter_map() localVariable
103 let it = in filter_map() localVariable
112 let mut it = convert(vec![0, 1, 2, 3].into_iter().map(Ok::<u32, u32>)); in find() localVariable
117 let it = convert(vec![0, 1, 2, 3].into_iter().map(Ok::<u32, u32>)); in find() localVariable
150 let it = convert(vec![0, 1, 3, 2].into_iter().map(Ok::<u32, u32>)); in fold() localVariable
153 let it = convert(vec![0, 1, 2, 1].into_iter().map(Ok::<u32, u32>)); in fold() localVariable
159 let it = convert(vec![0, 1, 2, 3].into_iter().map(Ok::<u32, ()>)); in for_each() localVariable
172 let it = convert( in iterator() localVariable
186 let it = convert(vec![0, 1, 2, 3].into_iter().map(Ok::<u32, ()>)); in last() localVariable
192 let it = convert(vec![0, 1, 2, 3, 4].into_iter().map(Ok::<u32, ()>)).map(|n| Ok(n * 2)); in map() localVariable
196 let it = convert(vec![0, 1, 2, 3, 4].into_iter().map(Ok::<u32, ()>)).map(|n| { in map() localVariable
205 let mut it = it.clone(); in map() localVariable
212 let mut it = it.rev(); in map() localVariable
221 let it = convert( in map_err() localVariable
233 let it = convert(vec![0, 3, 1, -10].into_iter().map(Ok::<i32, ()>)); in max() localVariable
239 let it = convert(vec![0, 3, 1, -10].into_iter().map(Ok::<i32, i32>)); in max_by_key() localVariable
252 let it = convert(vec![0, 3, 1, -10].into_iter().map(Ok::<i32, ()>)); in max_by() localVariable
258 let it = convert(vec![0, 3, -10, 1].into_iter().map(Ok::<i32, ()>)); in min() localVariable
264 let it = convert(vec![0, 3, 1, -10].into_iter().map(Ok::<i32, i32>)); in min_by_key() localVariable
277 let it = convert(vec![0, 3, 1, -10].into_iter().map(Ok::<i32, ()>)); in min_by() localVariable
283 let mut it = convert(vec![0, 1, 2, 3].into_iter().map(Ok::<i32, ()>)); in nth() localVariable
291 let mut it = convert(vec![0, 1].into_iter().map(Ok::<i32, ()>)).peekable(); in peekable() localVariable
302 let mut it = convert(vec![1, 2, 3, 4].into_iter().map(Ok::<i32, ()>)); in position() localVariable
307 let it = convert(vec![1, 2, 3, 4].into_iter().map(Ok::<i32, i32>)); in position() localVariable
322 let it = convert(vec![1, 2, 3, 4].into_iter().map(Ok::<i32, ()>)).scan(0, |st, v| { in scan() localVariable
335 let it = convert(vec![1, 2, 3, 4].into_iter().map(Ok::<i32, ()>)); in skip() localVariable
343 let it = convert(vec![1, 2, 3, 4, 1].into_iter().map(Ok::<i32, ()>)); in skip_while() localVariable
360 let it = convert( in step_by() localVariable
371 let it = convert(vec![0, 1, 2, 3].into_iter().map(Ok::<i32, ()>)).take(2); in take() localVariable
377 let it = convert(vec![0, 1, 2, 3, 0].into_iter().map(Ok::<i32, ()>)); in take_while() localVariable
394 let it = convert(vec![0..1, 0..0, 1..5].into_iter().map(Ok::<Range<i32>, ()>)) in flat_map() localVariable
401 let it = convert( in flatten() localVariable
414 let it = convert(vec![0, 1, 2, 3].into_iter().map(Ok::<i32, ()>)).inspect(|v| Ok(buf.push(*v))); in inspect() localVariable
421 let it = convert(vec![0, 1, 2, 3].into_iter().map(Ok::<i32, ()>)); in partition() localVariable
429 let mut it = convert(vec![0, 1, 2, 3].into_iter().map(Ok::<i32, ()>)); in find_map() localVariable
441 let it = convert( in unzip() localVariable
453 let it = convert(vec![0, 1, 2, 3].into_iter().map(Ok::<i32, ()>)).cycle(); in cycle() localVariable