@@ -15,7 +15,6 @@ use core::mem::{self, MaybeUninit};
1515use core:: ptr;
1616
1717use crate :: fake_usize_ptr:: FakeUsizePtr ;
18- use crate :: slice_const_split_at_mut:: ConstSplitAtMutExtensions ;
1918
2019/// When dropped, copies from `src` into `dest`.
2120struct CopyOnDrop < T > {
@@ -546,7 +545,7 @@ where
546545 let ( mid, was_partitioned) = {
547546 // Place the pivot at the beginning of slice.
548547 v. swap ( 0 , pivot) ;
549- let ( pivot, v) = v. const_split_at_mut ( 1 ) ;
548+ let ( pivot, v) = v. split_at_mut ( 1 ) ;
550549 let pivot = & mut pivot[ 0 ] ;
551550
552551 // Read the pivot into a stack-allocated variable for efficiency. If a following comparison
@@ -606,7 +605,7 @@ where
606605{
607606 // Place the pivot at the beginning of slice.
608607 v. swap ( 0 , pivot) ;
609- let ( pivot, v) = v. const_split_at_mut ( 1 ) ;
608+ let ( pivot, v) = v. split_at_mut ( 1 ) ;
610609 let pivot = & mut pivot[ 0 ] ;
611610
612611 // Read the pivot into a stack-allocated variable for efficiency. If a following comparison
@@ -877,8 +876,8 @@ const fn recurse<'a, T, F>(
877876 was_partitioned = was_p;
878877
879878 // Split the slice into `left`, `pivot`, and `right`.
880- let ( left, right) = v. const_split_at_mut ( mid) ;
881- let ( pivot, right) = right. const_split_at_mut ( 1 ) ;
879+ let ( left, right) = v. split_at_mut ( mid) ;
880+ let ( pivot, right) = right. split_at_mut ( 1 ) ;
882881 let pivot = & pivot[ 0 ] ;
883882
884883 // Recurse into the shorter side only in order to minimize the total number of recursive
@@ -957,8 +956,8 @@ const fn partition_at_index_loop<'a, T, F>(
957956 let ( mid, _) = partition ( v, pivot, is_less) ;
958957
959958 // Split the slice into `left`, `pivot`, and `right`.
960- let ( left, right) = v. const_split_at_mut ( mid) ;
961- let ( pivot, right) = right. const_split_at_mut ( 1 ) ;
959+ let ( left, right) = v. split_at_mut ( mid) ;
960+ let ( pivot, right) = right. split_at_mut ( 1 ) ;
962961 let pivot = & pivot[ 0 ] ;
963962
964963 if mid < index {
@@ -1026,8 +1025,8 @@ where
10261025 partition_at_index_loop ( v, index, & mut is_less, None ) ;
10271026 }
10281027
1029- let ( left, right) = v. const_split_at_mut ( index) ;
1030- let ( pivot, right) = right. const_split_at_mut ( 1 ) ;
1028+ let ( left, right) = v. split_at_mut ( index) ;
1029+ let ( pivot, right) = right. split_at_mut ( 1 ) ;
10311030 let pivot = & mut pivot[ 0 ] ;
10321031 ( left, pivot, right)
10331032}
0 commit comments