File: bench.e

package info (click to toggle)
smarteiffel 1.1-11
  • links: PTS
  • area: main
  • in suites: etch, etch-m68k
  • size: 12,288 kB
  • ctags: 40,785
  • sloc: ansic: 35,791; lisp: 4,036; sh: 1,783; java: 895; ruby: 613; python: 209; makefile: 115; csh: 78; cpp: 50
file content (78 lines) | stat: -rw-r--r-- 1,620 bytes parent folder | download | duplicates (3)
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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
deferred class BENCH
--
-- ARRAY3 vs. FIXED_ARRAY3 for `item'/`put'.
--

feature {NONE}

   -- Features `upper1', `upper2' and `upper3' may be changed 
   -- according to the power of your computer.

   upper1, upper2, upper3: INTEGER is 20; -- 150 for me;

   do_test_for(c3: COLLECTION3[INTEGER]) is
      require
         c3.lower1 = 0;
         c3.lower2 = 0;
         c3.lower2 = 0;
         c3.upper1 = upper1;
         c3.upper2 = upper2;
         c3.upper3 = upper3;
         c3.count1 = upper1 + 1;
         c3.count2 = upper2 + 1;
         c3.count3 = upper3 + 1
      local
	 i, j, k, v, max: INTEGER;
         random: STD_RAND;
      do
         !!random.with_seed(256);
	 from 
            i := c3.upper1;
         until
	    i < c3.lower1
	 loop
	    from
               j := c3.upper2;
            until
	       j < c3.lower2
	    loop
	       from 
                  k := c3.upper3;
               until
	          k < c3.lower3
	       loop
                  v := random.last_integer(4096);
                  random.next;
                  c3.put(v,i,j,k);
	          k := k - 1;
	       end;
               j := j - 1;
            end;
            i := i - 1;
	 end; 
	 from
	    i := c3.upper1;
	 until
	    i < c3.lower1
	 loop
	    from
	       j := c3.upper2;
	    until
	       j < c3.lower2
	    loop
	       from
	          k := c3.upper3;
	       until
	          k < c3.lower3
	       loop
                  v := c3.item(i,j,k);
                  max := max.max(v);
	          k := k - 1;
	       end;
               j := j - 1;
            end;
            i := i - 1;
	 end; 
      end

end