Sorting algorithms/Merge sort: Difference between revisions

Line 6,284:
#[inline(always)]
fn copy<T: Copy>(src: &[T], dst: &mut [T]) {
// for i in 0..src.len() {
// dst[i] = src[i];
// }
unsafe {
std::ptr::copy_nonoverlapping(src.as_ptr(), dst.as_mut_ptr(), src.len());
}
}
Line 6,349 ⟶ 6,352:
#[inline(always)]
fn copy<T: Copy>(src: &[T], dst: &mut [T]) {
// for i in 0..src.len() {
// dst[i] = src[i];
// }
unsafe {
std::ptr::copy_nonoverlapping(src.as_ptr(), dst.as_mut_ptr(), src.len());
}
}
21

edits