Home
last modified time | relevance | path

Searched refs:try_fold (Results 1 - 5 of 5) sorted by relevance

/third_party/mesa3d/src/gallium/drivers/r600/sb/
H A Dsb_expr.h65 bool try_fold(value *v);
66 bool try_fold(node *n);
H A Dsb_valtable.cpp150 if (v->def && ex.try_fold(v)) { in add_value()
H A Dsb_expr.cpp132 bool expr_handler::try_fold(value* v) { in try_fold() function in r600_sb::expr_handler
136 try_fold(v->def); in try_fold()
144 bool expr_handler::try_fold(node* n) { in try_fold() function in r600_sb::expr_handler
/third_party/rust/crates/nom/examples/
H A Diterator.rs46 .try_fold((data, Vec::new()), |(data, mut acc), parser| { in main()
64 // - we can get the remaining input afterwards, like with the `try_fold` trick in main()
/third_party/rust/crates/memchr/bench/data/code/
H A Drust-library.rs2465 b.iter(|| black_box(ring.iter().try_fold(0, |a, b| Some(a + b)))) in bench_try_fold()
12698 assert_eq!(Some(0), VecDeque::<u32>::new().iter().try_fold(0, |_, _| None)); in test_try_fold_empty()
12704 assert_eq!(None, v.into_iter().try_fold(0, |a, b| if b < 11 { Some(a + b) } else { None })); in test_try_fold_none()
12710 assert_eq!(Ok::<_, ()>(66), v.into_iter().try_fold(0, |a, b| Ok(a + b))); in test_try_fold_ok()
12716 assert_eq!(Some(()), v.into_iter().try_fold((), |(), ()| Some(()))); in test_try_fold_unit()
12723 assert!(iter.try_fold((), |_, _| None).is_none()); in test_try_fold_unit_none()
12736 assert_eq!(Ok::<_, ()>(66), v.iter().try_fold(0, |a, b| Ok(a + b))); in test_try_fold_rotated()
12744 assert_eq!(iter.try_fold(0_i8, |acc, &x| acc.checked_add(x)), None); in test_try_fold_moves_iter()
12757 let _ = iter.try_fold(0, |_, _| Some(1)); in test_try_fold_exhaust_wrap()
15133 slice.iter().map(|s| s.borrow().as_ref().len()).try_fold( in join_generic_copy()
43345 fn try_fold<B, F, R>(&mut self, init: B, mut f: F) -> R try_fold() functions
[all...]

Completed in 31 milliseconds