Lines Matching defs:reverse
2352 macro_rules! reverse {
2359 b.iter(|| black_box(&mut v[1..]).reverse());
2365 reverse!(reverse_u8, u8, |x| x as u8);
2366 reverse!(reverse_u16, u16, |x| x as u16);
2367 reverse!(reverse_u8x3, [u8; 3], |x| [x as u8, (x >> 8) as u8, (x >> 16) as u8]);
2368 reverse!(reverse_u32, u32, |x| x as u32);
2369 reverse!(reverse_u64, u64, |x| x as u64);
2370 reverse!(reverse_u128, u128, |x| x as u128);
2373 reverse!(reverse_simd_f64x4, F64x4, |x| {
4830 // (A different predicate is needed for reverse iterator vs normal iterator.)
5034 split.reverse();
5038 split.reverse();
5043 split.reverse();
5047 split.reverse();
5059 rsplit.reverse();
5066 rsplit.reverse();
5074 rsplit.reverse();
5081 rsplit.reverse();
5090 split.reverse();
5094 split.reverse();
5258 v.reverse();
5390 bwd_vec.reverse();
9617 v.reverse();
9622 v3.reverse();
9627 v.reverse();
9632 v.reverse();
9673 v.reverse();
9678 v[a..b].reverse();
10363 values[1..4].reverse();
10534 slice.reverse();
10540 slice.reverse();
10549 slice.reverse();
11004 input[a..b].reverse();
16199 //! it. You can do the reverse too.
17601 /// vec.reverse();
21625 // Thus, we reverse the offset to get the whole RcBox.
22274 /// // reverse sorting
23039 // Find the next natural run, and reverse it if it's strictly descending.
23048 v[start..end].reverse();
25037 // Thus, we reverse the offset to get the whole RcBox.
25843 //! `{2} {1} {0}`, however, would format arguments in reverse order.
29504 if self.1.flipped.get() { ord.reverse() } else { ord }
36362 if COMPARES.fetch_add(1, SeqCst) > 0 { ord.reverse() } else { ord }
42525 /// // sorting it in reverse order
44496 /// // If we pop these scores now, they should come back in the reverse order.