Vwwxrf

How do researchers send unsolicited emails asking for feedback on their works?

UK Tourist Visa- Enquiry

The English Debate

Can "few" be used as a subject? If so, what is the rule?

Friend wants my recommendation but I don't want to

TDE Master Key Rotation

Air travel with refrigerated insulin

Have the tides ever turned twice on any open problem?

How can a new country break out from a developed country without war?

Exposing a company lying about themselves in a tightly knit industry: Is my career at risk on the long run?

Does the Shadow Magic sorcerer's Eyes of the Dark feature work on all Darkness spells or just his/her own?

Fair way to split coins

Writing in a Christian voice

When did hardware antialiasing start being available?

Should I be concerned about student access to a test bank?

What is the difference between something being completely legal and being completely decriminalized?

Knife as defense against stray dogs

Do I need to convey a moral for each of my blog post?

Would mining huge amounts of resources on the Moon change its orbit?

label a part of commutative diagram

Do I need an EFI partition for each 18.04 ubuntu I have on my HD?

10 year ban after applying for a UK student visa

Extraneous elements in "Europe countries" list

Do people actually use the word "kaputt" in conversation?

Incremental Sieve of Eratosthenes

Threshing: Sieve of EratosthenesAttemped Sieve of EratosthenesSieve of Eratosthenes Optimization in RustPurely functional Sieve of EratosthenesThe rusty Sieve of EratosthenesCustom Sieve of EratosthenesPrime Sieve in Rust (Sieve of Eratosthenes)Eratosthenes Sieve ImplementationSieve of Eratosthenes in RustShort Eratosthenes Sieve

1

$begingroup$

I am in the process of learning rust and am still having some issues with borrowing and ownership. I find myself trying to borrow mutable references that are already borrowed as immutable references etc...

I noticed that when I try to iterate over the primes without owning them, I encounter issues trying to modify the composites hash map. I was able to get around this by calling to_owned on the vector. Is this the right way to handle this?

This uses the generator feature.

cargo -V 
cargo 1.35.0-nightly (0e35bd8af 2019-03-13)

 #![feature(generators, generator_trait)]

 use std::collections::HashMap;
 use std::ops::Generator, GeneratorState;

 let mut sieve = || 
 let mut x: u32 = 2;
 let mut composites: HashMap<u32, Vec<u32>> = HashMap::new();

 loop 
 match composites.get(&x) 
 Some(primes) => 
 for _prime in primes.to_owned() 
 composites
 .entry(x + _prime)
 .and_modify(
 
 None => 
 yield x;
 composites.insert(x * x, vec![x]);
 
 

 x = x + 1;
 
 ;

rust sieve-of-eratosthenes

share|improve this question

edited 10 mins ago

Jamal♦

30.4k11121227

asked 4 hours ago

kylekyle

1316

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  @Stargateur this code is working, it does require generators though
  $endgroup$
  – kyle
  4 hours ago
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  @E_net4 I apologize, I had added in this information!
  $endgroup$
  – kyle
  3 hours ago
  

  
  
  
  

add a comment | 

1

$begingroup$

I am in the process of learning rust and am still having some issues with borrowing and ownership. I find myself trying to borrow mutable references that are already borrowed as immutable references etc...

I noticed that when I try to iterate over the primes without owning them, I encounter issues trying to modify the composites hash map. I was able to get around this by calling to_owned on the vector. Is this the right way to handle this?

This uses the generator feature.

cargo -V 
cargo 1.35.0-nightly (0e35bd8af 2019-03-13)

 #![feature(generators, generator_trait)]

 use std::collections::HashMap;
 use std::ops::Generator, GeneratorState;

 let mut sieve = || 
 let mut x: u32 = 2;
 let mut composites: HashMap<u32, Vec<u32>> = HashMap::new();

 loop 
 match composites.get(&x) 
 Some(primes) => 
 for _prime in primes.to_owned() 
 composites
 .entry(x + _prime)
 .and_modify(
 
 None => 
 yield x;
 composites.insert(x * x, vec![x]);
 
 

 x = x + 1;
 
 ;

rust sieve-of-eratosthenes

share|improve this question

edited 10 mins ago

Jamal♦

30.4k11121227

asked 4 hours ago

kylekyle

1316

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  @Stargateur this code is working, it does require generators though
  $endgroup$
  – kyle
  4 hours ago
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  @E_net4 I apologize, I had added in this information!
  $endgroup$
  – kyle
  3 hours ago
  

  
  
  
  

add a comment | 

$begingroup$

I am in the process of learning rust and am still having some issues with borrowing and ownership. I find myself trying to borrow mutable references that are already borrowed as immutable references etc...

I noticed that when I try to iterate over the primes without owning them, I encounter issues trying to modify the composites hash map. I was able to get around this by calling to_owned on the vector. Is this the right way to handle this?

This uses the generator feature.

cargo -V 
cargo 1.35.0-nightly (0e35bd8af 2019-03-13)

 #![feature(generators, generator_trait)]

 use std::collections::HashMap;
 use std::ops::Generator, GeneratorState;

 let mut sieve = || 
 let mut x: u32 = 2;
 let mut composites: HashMap<u32, Vec<u32>> = HashMap::new();

 loop 
 match composites.get(&x) 
 Some(primes) => 
 for _prime in primes.to_owned() 
 composites
 .entry(x + _prime)
 .and_modify(
 
 None => 
 yield x;
 composites.insert(x * x, vec![x]);
 
 

 x = x + 1;
 
 ;

rust sieve-of-eratosthenes

share|improve this question

edited 10 mins ago

Jamal♦

30.4k11121227

asked 4 hours ago

kylekyle

1316

$endgroup$

cargo -V 
cargo 1.35.0-nightly (0e35bd8af 2019-03-13)

 #![feature(generators, generator_trait)]

 use std::collections::HashMap;
 use std::ops::Generator, GeneratorState;

 let mut sieve = || 
 let mut x: u32 = 2;
 let mut composites: HashMap<u32, Vec<u32>> = HashMap::new();

 loop 
 match composites.get(&x) 
 Some(primes) => 
 for _prime in primes.to_owned() 
 composites
 .entry(x + _prime)
 .and_modify(
 
 None => 
 yield x;
 composites.insert(x * x, vec![x]);
 
 

 x = x + 1;
 
 ;

share|improve this question

edited 10 mins ago

Jamal♦

30.4k11121227

asked 4 hours ago

kylekyle

1316

share|improve this question

edited 10 mins ago

Jamal♦

30.4k11121227

asked 4 hours ago

kylekyle

1316

edited 10 mins ago

Jamal♦

30.4k11121227

edited 10 mins ago

Jamal♦

30.4k11121227

asked 4 hours ago

kylekyle

1316

asked 4 hours ago

kylekyle

1316