Add ranges.

This commit is contained in:
Stephen Chung
2021-12-15 12:06:17 +08:00
parent 7251f34bce
commit ef14079c61
35 changed files with 1206 additions and 269 deletions

View File

@@ -67,7 +67,7 @@ fn bench_eval_array_loop(bench: &mut Bencher) {
let script = r#"
let list = [];
for i in range(0, 10_000) {
for i in 0..10_000 {
list.push(i);
}

View File

@@ -110,7 +110,7 @@ fn bench_eval_call(bench: &mut Bencher) {
fn bench_eval_loop_number(bench: &mut Bencher) {
let script = r#"
let s = 0;
for x in range(0, 10000) {
for x in 0..10000 {
s += 1;
}
"#;
@@ -127,7 +127,7 @@ fn bench_eval_loop_number(bench: &mut Bencher) {
fn bench_eval_loop_strings_build(bench: &mut Bencher) {
let script = r#"
let s;
for x in range(0, 10000) {
for x in 0..10000 {
s = "hello, world!" + "hello, world!";
}
"#;
@@ -144,7 +144,7 @@ fn bench_eval_loop_strings_build(bench: &mut Bencher) {
fn bench_eval_loop_strings_no_build(bench: &mut Bencher) {
let script = r#"
let s;
for x in range(0, 10000) {
for x in 0..10000 {
s = "hello" + "";
}
"#;
@@ -163,7 +163,7 @@ fn bench_eval_switch(bench: &mut Bencher) {
let sum = 0;
let rem = 0;
for x in range(0, 10) {
for x in 0..10 {
rem = x % 10;
sum += switch rem {
@@ -195,7 +195,7 @@ fn bench_eval_nested_if(bench: &mut Bencher) {
let sum = 0;
let rem = 0;
for x in range(0, 10) {
for x in 0..10 {
rem = x % 10;
sum += if rem == 0 { 10 }

View File

@@ -51,7 +51,7 @@ fn bench_iterations_array(bench: &mut Bencher) {
let script = r#"
let x = [];
x.pad(1000, 0);
for i in range(0, 1000) { x[i] = i % 256; }
for i in 0..1000 { x[i] = i % 256; }
"#;
let mut engine = Engine::new();
@@ -66,7 +66,7 @@ fn bench_iterations_array(bench: &mut Bencher) {
fn bench_iterations_blob(bench: &mut Bencher) {
let script = r#"
let x = blob(1000, 0);
for i in range(0, 1000) { x[i] = i % 256; }
for i in 0..1000 { x[i] = i % 256; }
"#;
let mut engine = Engine::new();

View File

@@ -79,7 +79,7 @@ fn bench_parse_primes(bench: &mut Bencher) {
let total_primes_found = 0;
for p in range(2, MAX_NUMBER_TO_CHECK) {
for p in 2..=MAX_NUMBER_TO_CHECK {
if prime_mask[p] {
print(p);

View File

@@ -19,7 +19,7 @@ prime_mask[1] = false;
let total_primes_found = 0;
for p in range(2, MAX_NUMBER_TO_CHECK) {
for p in 2..=MAX_NUMBER_TO_CHECK {
if prime_mask[p] {
total_primes_found += 1;
let i = 2 * p;