Noratrieb/benchmarks
1
0
Fork 0
mirror of https://github.com/Noratrieb/benchmarks.git synced 2026-01-14 10:45:04 +01:00
Code Issues Projects Releases Packages Wiki Activity Actions

fixed rust bug - used usize instead of u32

Browse source
This commit is contained in:
nora 2021-06-07 15:14:09 +02:00
parent e1478285a7
commit f76f06fd25
2 changed files with 5 additions and 5 deletions
Download patch file Download diff file Expand all files Collapse all files

2
primes/README.md
View file

@ -11,5 +11,5 @@ and we should never forget that V8 is... **fast**.
| ---------| -------| | ---------| -------|
| Java | 1836ms | | Java | 1836ms |
| Javascript | 1778ms | | Javascript | 1778ms |
| Rust | 1818ms | | Rust | 577ms |
| python3 | 34361ms | | python3 | 34361ms |

8
primes/rust/src/main.rs
View file

@ -3,7 +3,7 @@ use std::time::{SystemTime};
fn main() { fn main() {
let mut times = Vec::new(); let mut times = Vec::new();
for i in 0..2 { for i in 0..10 {
println!("Starting run {}", i); println!("Starting run {}", i);
let start = SystemTime::now(); let start = SystemTime::now();
let _ = primes(10_000_000); let _ = primes(10_000_000);
@ -19,14 +19,14 @@ fn main() {
} }
fn primes(max: usize) -> Vec<usize> { fn primes(max: u32) -> Vec<u32> {
let mut primes_list = Vec::new(); let mut primes_list: Vec<u32> = Vec::new();
primes_list.push(2); primes_list.push(2);
for i in 3..max { //go through all numbers for i in 3..max { //go through all numbers
for prime in &primes_list { //test each number for prime in &primes_list { //test each number
if *prime > (i as f64).sqrt() as usize { if *prime > (i as f64).sqrt() as u32 {
primes_list.push(i); primes_list.push(i);
break; break;
} }