Tom*_*Tom 2 swap mutable rust borrow
我有一个使用 Rust 创建冒泡排序的编程作业。我在 Rust 方面确实没有太多经验,所以这对我来说有点困难:
fn main() {
println!("Sort numbers ascending");
let num:[i32; 10] = [4, 65, 2, -31, 0, 99, 2, 83, 782, 1];
println!("Before: {:?}", num);
bubble_sort( num);
println!("After: {:?}\n", num);
}
fn swap( a: &mut i32, b: &mut i32){
let tmp: i32 = *b;
*b=*a;
*a=tmp;
}
fn bubble_sort(mut arr: [i32; 10]) {
for i in 0..arr.len() {
for j in 0..arr.len() - 1 - i {
if arr[j] > arr[j + 1] {
swap( &mut arr[j], &mut arr[j + 1]);
}
}
}
}
Run Code Online (Sandbox Code Playgroud)
错误:
Compiling playground v0.0.1 (/playground)
error[E0499]: cannot borrow `arr[_]` as mutable more than once at a time
--> src/main.rs:19:24
|
19 | swap( &mut arr[j], &mut arr[j + 1]);
| ---- ----------- ^^^^^^^^^^^^^^^ second mutable borrow occurs here
| | |
| | first mutable borrow occurs here
| first borrow later used by call
|
= help: consider using `.split_at_mut(position)` or similar method to obtain two mutable non-overlapping sub-slices
For more information about this error, try `rustc --explain E0499`.
error: could not compile `playground` due to previous error
Run Code Online (Sandbox Code Playgroud)
Rust 借用检查器非常复杂,但也有局限性。在这里,尽管对于人类来说很明显没有发生可变别名,但借用检查器完全隐藏了这一事实。它看到&mut arr[j]
并&mut arr[j + 1]
得出结论:“你试图从两次中可变地借用arr
”。
错误消息确实指出了解决方案:
split_at_mut()
正是针对这种情况而提供的。在幕后,它用来unsafe
以仍然健全且不会导致 UB 的方式弯曲上述规则。它需要一个索引来分割,并返回 2 个不重叠的可变切片。这是文档中的示例:
let mut v = [1, 0, 3, 0, 5, 6];
let (left, right) = v.split_at_mut(2);
assert_eq!(left, [1, 0]);
assert_eq!(right, [3, 0, 5, 6]);
Run Code Online (Sandbox Code Playgroud)
因此,在您的情况下,您可以执行以下操作,而不是使用&mut arr[j]
该数字来获取可变引用:
let (start, end) = arr.split_at_mut(1);
swap(&mut start[0], &mut end[0]);
Run Code Online (Sandbox Code Playgroud)
PS 还有.swap(i, j)
切片:-D
归档时间: |
|
查看次数: |
366 次 |
最近记录: |