benchmark/so_lists.yml


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51

prelude: |
  #from http://www.bagley.org/~doug/shootout/bench/lists/lists.ruby
benchmark:
  so_lists: |

    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
loop_count: 1