diff options
| author | Yukihiro Matsumoto <[email protected]> | 2012-07-31 19:00:52 +0900 |
|---|---|---|
| committer | Yukihiro Matsumoto <[email protected]> | 2012-07-31 19:00:52 +0900 |
| commit | e064ff2098f8cf6e409b86df2d3b0da3217ff1a8 (patch) | |
| tree | 2f8163c8dc43ae34b3dd45d4bb8f9fe3791a396f /benchmark/bm_so_lists.rb | |
| parent | bc7dc06c51a1566c7918b1992cb546e70d78c552 (diff) | |
| download | mruby-e064ff2098f8cf6e409b86df2d3b0da3217ff1a8.tar.gz mruby-e064ff2098f8cf6e409b86df2d3b0da3217ff1a8.zip | |
add some benchmark programs
Diffstat (limited to 'benchmark/bm_so_lists.rb')
| -rw-r--r-- | benchmark/bm_so_lists.rb | 47 |
1 files changed, 47 insertions, 0 deletions
diff --git a/benchmark/bm_so_lists.rb b/benchmark/bm_so_lists.rb new file mode 100644 index 000000000..f8d26797a --- /dev/null +++ b/benchmark/bm_so_lists.rb @@ -0,0 +1,47 @@ +#from http://www.bagley.org/~doug/shootout/bench/lists/lists.ruby + +NUM = 300 +SIZE = 10000 + +def test_lists() + # create a list of integers (Li1) from 1 to SIZE + li1 = (1..SIZE).to_a + # copy the list to li2 (not by individual items) + li2 = li1.dup + # remove each individual item from left side of li2 and + # append to right side of li3 (preserving order) + li3 = Array.new + while (not li2.empty?) + li3.push(li2.shift) + end + # li2 must now be empty + # remove each individual item from right side of li3 and + # append to right side of li2 (reversing list) + while (not li3.empty?) + li2.push(li3.pop) + end + # li3 must now be empty + # reverse li1 in place + li1.reverse! + # check that first item is now SIZE + if li1[0] != SIZE then + p "not SIZE" + 0 + else + # compare li1 and li2 for equality + if li1 != li2 then + return(0) + else + # return the length of the list + li1.length + end + end +end + +i = 0 +while i<NUM + i+=1 + result = test_lists() +end + +result |
