Lines Matching refs:Ok
8 assert!(convert([0, 1, 2, 3].iter().map(Ok::<&u32, ()>)) in all()
9 .all(|&i| Ok(i < 4)) in all()
11 assert!(!convert([0, 1, 2, 4].iter().map(Ok::<&u32, ()>)) in all()
12 .all(|&i| Ok(i < 4)) in all()
14 assert!(convert([0, 1, 2, 4].iter().map(Ok::<&u32, ()>)) in all()
21 assert!(convert([0, 1, 2, 3].iter().map(Ok::<&u32, ()>)) in any()
22 .any(|&i| Ok(i == 3)) in any()
24 assert!(!convert([0, 1, 2, 4].iter().map(Ok::<&u32, ()>)) in any()
25 .any(|&i| Ok(i == 3)) in any()
27 assert!(convert([0, 1, 2, 4].iter().map(Ok::<&u32, ()>)) in any()
34 let a = convert(vec![0, 1, 2, 3].into_iter().map(Ok::<u32, ()>)); in chain()
35 let b = convert(vec![4, 5, 6, 7].into_iter().map(Ok::<u32, ()>)); in chain()
40 let a = convert(vec![0, 1, 2, 3].into_iter().map(Ok::<u32, ()>)); in chain()
41 let b = convert(vec![4, 5, 6, 7].into_iter().map(Ok::<u32, ()>)); in chain()
50 convert([0, 1, 2, 3].iter().map(Ok::<&u32, ()>)) in count()
56 let it = Some(Ok(1)).into_iter().chain(iter::repeat(Err(()))); in count()
62 let it = convert(vec![5, 6, 7, 8].into_iter().map(Ok::<u32, ()>)).enumerate(); in enumerate()
72 let it = convert(vec![0, 1, 2, 3].into_iter().map(Ok::<u32, u32>)); in filter()
73 let it = it.filter(|&x| if x % 2 == 0 { Ok(x % 3 == 0) } else { Err(x) }); in filter()
78 let it = convert(vec![0, 2, 4, 6].into_iter().map(Ok::<u32, u32>)); in filter()
79 let it = it.filter(|&x| if x % 2 == 0 { Ok(x % 3 == 0) } else { Err(x) }); in filter()
81 assert_eq!(it.clone().collect::<Vec<_>>(), Ok(vec![0, 6])); in filter()
82 assert_eq!(it.rev().collect::<Vec<_>>(), Ok(vec![6, 0])) in filter()
89 Ok(Some(x + 10)) in filter_map()
91 Ok(None) in filter_map()
97 let it = convert(vec![0, 1, 2, 3, 4, 5, 6].into_iter().map(Ok::<u32, u32>)) in filter_map()
104 convert(vec![0, 2, 3, 4, 6].into_iter().map(Ok::<u32, u32>)).filter_map(twos_and_threes); in filter_map()
106 assert_eq!(it.clone().collect::<Vec<_>>(), Ok(vec![10, 12, 14, 16])); in filter_map()
107 assert_eq!(it.rev().collect::<Vec<_>>(), Ok(vec![16, 14, 12, 10])); in filter_map()
112 let mut it = convert(vec![0, 1, 2, 3].into_iter().map(Ok::<u32, u32>)); in find()
114 assert_eq!(it.find(|x| Ok(x % 2 == 1)), Ok(Some(1))); in find()
115 assert_eq!(it.next(), Ok(Some(2))); in find()
117 let it = convert(vec![0, 1, 2, 3].into_iter().map(Ok::<u32, u32>)); in find()
120 .find(|&x| if x == 2 { Err(29) } else { Ok(false) }), in find()
125 .find(|&x| if x == 2 { Err(29) } else { Ok(true) }), in find()
126 Ok(Some(0)) in find()
131 .find(|&x| if x == 2 { Err(29) } else { Ok(false) }), in find()
135 it.rev().find(|&x| if x == 2 { Err(29) } else { Ok(true) }), in find()
136 Ok(Some(3)) in find()
144 Ok(a + b) in fold()
150 let it = convert(vec![0, 1, 3, 2].into_iter().map(Ok::<u32, u32>)); in fold()
153 let it = convert(vec![0, 1, 2, 1].into_iter().map(Ok::<u32, u32>)); in fold()
154 assert_eq!(it.fold(0, add_smol), Ok(4)); in fold()
159 let it = convert(vec![0, 1, 2, 3].into_iter().map(Ok::<u32, ()>)); in for_each()
164 Ok(()) in for_each()
175 .map(|c| if c.is_whitespace() { Err(()) } else { Ok(c) }), in iterator()
186 let it = convert(vec![0, 1, 2, 3].into_iter().map(Ok::<u32, ()>)); in last()
192 let it = convert(vec![0, 1, 2, 3, 4].into_iter().map(Ok::<u32, ()>)).map(|n| Ok(n * 2)); in map()
196 let it = convert(vec![0, 1, 2, 3, 4].into_iter().map(Ok::<u32, ()>)).map(|n| { in map()
200 Ok(n * 2) in map()
206 assert_eq!(it.next(), Ok(Some(0))); in map()
207 assert_eq!(it.next(), Ok(Some(2))); in map()
213 assert_eq!(it.next(), Ok(Some(8))); in map()
214 assert_eq!(it.next(), Ok(Some(6))); in map()
224 .map(|n| if n % 2 == 0 { Ok(n) } else { Err(n) }), in map_err()
233 let it = convert(vec![0, 3, 1, -10].into_iter().map(Ok::<i32, ()>)); in max()
239 let it = convert(vec![0, 3, 1, -10].into_iter().map(Ok::<i32, i32>)); in max_by_key()
240 assert_eq!(it.clone().max_by_key(|&i| Ok(-i)), Ok(Some(-10))); in max_by_key()
245 .max_by_key(|&i| if i > 0 { Err(i) } else { Ok(-i) }), in max_by_key()
252 let it = convert(vec![0, 3, 1, -10].into_iter().map(Ok::<i32, ()>)); in max_by()
253 assert_eq!(it.max_by(|a, b| Ok(b.cmp(a))), Ok(Some(-10))); in max_by()
258 let it = convert(vec![0, 3, -10, 1].into_iter().map(Ok::<i32, ()>)); in min()
264 let it = convert(vec![0, 3, 1, -10].into_iter().map(Ok::<i32, i32>)); in min_by_key()
265 assert_eq!(it.clone().min_by_key(|&i| Ok(-i)), Ok(Some(3))); in min_by_key()
270 .min_by_key(|&i| if i > 0 { Err(i) } else { Ok(-i) }), in min_by_key()
277 let it = convert(vec![0, 3, 1, -10].into_iter().map(Ok::<i32, ()>)); in min_by()
278 assert_eq!(it.min_by(|a, b| Ok(b.cmp(a))), Ok(Some(3))); in min_by()
283 let mut it = convert(vec![0, 1, 2, 3].into_iter().map(Ok::<i32, ()>)); in nth()
291 let mut it = convert(vec![0, 1].into_iter().map(Ok::<i32, ()>)).peekable(); in peekable()
302 let mut it = convert(vec![1, 2, 3, 4].into_iter().map(Ok::<i32, ()>)); in position()
303 assert_eq!(it.position(|n| Ok(n == 2)).unwrap(), Some(1)); in position()
304 assert_eq!(it.position(|n| Ok(n == 3)).unwrap(), Some(0)); in position()
305 assert_eq!(it.position(|n| Ok(n == 5)).unwrap(), None); in position()
307 let it = convert(vec![1, 2, 3, 4].into_iter().map(Ok::<i32, i32>)); in position()
310 .position(|n| if n == 3 { Err(42) } else { Ok(n == 2) }), in position()
311 Ok(Some(1)) in position()
315 .position(|n| if n == 3 { Err(42) } else { Ok(n == 4) }), in position()
322 let it = convert(vec![1, 2, 3, 4].into_iter().map(Ok::<i32, ()>)).scan(0, |st, v| { in scan()
324 Ok(None) in scan()
327 Ok(Some(-*st)) in scan()
330 assert_eq!(it.collect::<Vec<_>>(), Ok(vec![-1, -3, -6])); in scan()
335 let it = convert(vec![1, 2, 3, 4].into_iter().map(Ok::<i32, ()>)); in skip()
336 assert_eq!(it.clone().skip(0).collect::<Vec<_>>(), Ok(vec![1, 2, 3, 4])); in skip()
337 assert_eq!(it.clone().skip(2).collect::<Vec<_>>(), Ok(vec![3, 4])); in skip()
338 assert_eq!(it.clone().skip(4).collect::<Vec<_>>(), Ok(vec![])); in skip()
343 let it = convert(vec![1, 2, 3, 4, 1].into_iter().map(Ok::<i32, ()>)); in skip_while()
345 it.clone().skip_while(|x| Ok(*x < 1)).collect::<Vec<_>>(), in skip_while()
346 Ok(vec![1, 2, 3, 4, 1]) in skip_while()
349 it.clone().skip_while(|x| Ok(*x < 3)).collect::<Vec<_>>(), in skip_while()
350 Ok(vec![3, 4, 1]) in skip_while()
353 it.clone().skip_while(|x| Ok(*x < 5)).collect::<Vec<_>>(), in skip_while()
354 Ok(vec![]) in skip_while()
363 .map(Ok::<i32, ()>), in step_by()
366 assert_eq!(it.collect::<Vec<_>>(), Ok(vec![0, 3, 6])); in step_by()
371 let it = convert(vec![0, 1, 2, 3].into_iter().map(Ok::<i32, ()>)).take(2); in take()
377 let it = convert(vec![0, 1, 2, 3, 0].into_iter().map(Ok::<i32, ()>)); in take_while()
379 it.clone().take_while(|x| Ok(*x < 0)).collect::<Vec<_>>(), in take_while()
380 Ok(vec![]) in take_while()
383 it.clone().take_while(|x| Ok(*x < 2)).collect::<Vec<_>>(), in take_while()
384 Ok(vec![0, 1]) in take_while()
387 it.clone().take_while(|x| Ok(*x < 4)).collect::<Vec<_>>(), in take_while()
388 Ok(vec![0, 1, 2, 3, 0]) in take_while()
394 let it = convert(vec![0..1, 0..0, 1..5].into_iter().map(Ok::<Range<i32>, ()>)) in flat_map()
395 .flat_map(|r| Ok(convert(r.map(Ok::<i32, ()>)))); in flat_map()
396 assert_eq!(it.collect::<Vec<_>>(), Ok(vec![0, 1, 2, 3, 4])); in flat_map()
404 .map(|r| convert(r.map(Ok::<i32, ()>))) in flatten()
405 .map(Ok::<_, ()>), in flatten()
408 assert_eq!(it.collect::<Vec<_>>(), Ok(vec![0, 1, 2, 3, 4])); in flatten()
414 let it = convert(vec![0, 1, 2, 3].into_iter().map(Ok::<i32, ()>)).inspect(|v| Ok(buf.push(*v))); in inspect()
421 let it = convert(vec![0, 1, 2, 3].into_iter().map(Ok::<i32, ()>)); in partition()
422 let (even, odd): (Vec<i32>, Vec<i32>) = it.partition(|i| Ok(*i % 2 == 0)).unwrap(); in partition()
429 let mut it = convert(vec![0, 1, 2, 3].into_iter().map(Ok::<i32, ()>)); in find_map()
432 2 => Ok(Some("hi")), in find_map()
433 _ => Ok(None), in find_map()
435 Ok(Some("hi")) in find_map()
444 .map(Ok::<_, ()>), in unzip()
453 let it = convert(vec![0, 1, 2, 3].into_iter().map(Ok::<i32, ()>)).cycle(); in cycle()
454 assert_eq!(it.take(6).clone().collect::<Vec<_>>(), Ok(vec![0, 1, 2, 3, 0, 1])); in cycle()