@@ -10,6 +10,7 @@ type BufType = [usize; 32];
10
10
/// # Safety
11
11
///
12
12
/// The specified range must be valid for reading and writing.
13
+ #[ inline]
13
14
pub ( super ) unsafe fn ptr_rotate < T > ( left : usize , mid : * mut T , right : usize ) {
14
15
if T :: IS_ZST {
15
16
return ;
@@ -43,6 +44,7 @@ pub(super) unsafe fn ptr_rotate<T>(left: usize, mid: *mut T, right: usize) {
43
44
/// # Safety
44
45
///
45
46
/// The specified range must be valid for reading and writing.
47
+ #[ inline]
46
48
unsafe fn ptr_rotate_memmove < T > ( left : usize , mid : * mut T , right : usize ) {
47
49
// The `[T; 0]` here is to ensure this is appropriately aligned for T
48
50
let mut rawarray = MaybeUninit :: < ( BufType , [ T ; 0 ] ) > :: uninit ( ) ;
@@ -114,6 +116,7 @@ unsafe fn ptr_rotate_memmove<T>(left: usize, mid: *mut T, right: usize) {
114
116
/// # Safety
115
117
///
116
118
/// The specified range must be valid for reading and writing.
119
+ #[ inline]
117
120
unsafe fn ptr_rotate_gcd < T > ( left : usize , mid : * mut T , right : usize ) {
118
121
// Algorithm 2
119
122
// Microbenchmarks indicate that the average performance for random shifts is better all
@@ -218,6 +221,7 @@ unsafe fn ptr_rotate_gcd<T>(left: usize, mid: *mut T, right: usize) {
218
221
/// # Safety
219
222
///
220
223
/// The specified range must be valid for reading and writing.
224
+ #[ inline]
221
225
unsafe fn ptr_rotate_swap < T > ( mut left : usize , mut mid : * mut T , mut right : usize ) {
222
226
loop {
223
227
if left >= right {
0 commit comments