HiveBrain v1.2.0
Get Started
← Back to all entries
debugrustCritical

What do I have to do to solve a "use of moved value" error?

Submitted by: @import:stackoverflow-api··
0
Viewed 0 times
errormovedhavewhatusevaluesolve

Problem

I'm trying to compute the 10,001st prime in Rust (Project Euler 7), and as a part of this, my method to check whether or not an integer is prime references a vector:

fn main() {
    let mut count: u32 = 1;
    let mut num: u64 = 1;
    let mut primes: Vec = Vec::new();
    primes.push(2);

    while count ) -> bool {
    for i in p {
        if num > i && num % i != 0 {
            return false;
        }
    }

    true
}


When I try to reference the vector, I get the following error:

error[E0382]: use of moved value: primes
--> src/main.rs:9:31
|
9 | if vectorIsPrime(num, primes) {
| ^^^^^^ value moved here, in previous iteration of loop
|
= note: move occurs because
primes has type std::vec::Vec, which does not implement the Copy trait


What do I have to do to primes in order to be able to access it within the vectorIsPrime function?

Solution

With the current definition of your function vectorIsPrime(), the function specifies that it requires ownership of the parameter because you pass it by value.

When a function requires a parameter by value, the compiler will check if the value can be copied by checking if it implements the trait Copy.

  • If it does, the value is copied (with a memcpy) and given to the function, and you can still continue to use your original value.



  • If it doesn't, then the value is moved to the given function, and the caller cannot use it afterwards



That is the meaning of the error message you have.

However, most functions do not require ownership of the parameters: they can work on "borrowed references", which means they do not actually own the value (and cannot for example put it in a container or destroy it).

fn main() {
    let mut count: u32 = 1;
    let mut num: u64 = 1;
    let mut primes: Vec = Vec::new();
    primes.push(2);

    while count  bool {
    for &i in p {
        if num > i && num % i != 0 {
            return false;
        }
    }
    true
}


The function vector_is_prime() now specifies that it only needs a slice, i.e. a borrowed pointer to an array (including its size) that you can obtain from a vector using the borrow operator &.

For more information about ownership, I invite you to read the part of the book dealing with ownership.

Code Snippets

fn main() {
    let mut count: u32 = 1;
    let mut num: u64 = 1;
    let mut primes: Vec<u64> = Vec::new();
    primes.push(2);

    while count < 10001 {
        num += 2;
        if vector_is_prime(num, &primes) {
            count += 1;
            primes.push(num);
        }
    }
}

fn vector_is_prime(num: u64, p: &[u64]) -> bool {
    for &i in p {
        if num > i && num % i != 0 {
            return false;
        }
    }
    true
}

Context

Stack Overflow Q#28800121, score: 135

Revisions (0)

No revisions yet.