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
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
|
-- This file is part of SmartEiffel The GNU Eiffel Compiler.
-- Copyright (C) 1994-98 LORIA - UHP - CRIN - INRIA - FRANCE
-- Dominique COLNET and Suzanne COLLIN - colnet@loria.fr
-- http://SmartEiffel.loria.fr
-- SmartEiffel is free software; you can redistribute it and/or modify it
-- under the terms of the GNU General Public License as published by the Free
-- Software Foundation; either version 2, or (at your option) any later
-- version. SmartEiffel is distributed in the hope that it will be useful,but
-- WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
-- for more details. You should have received a copy of the GNU General
-- Public License along with SmartEiffel; see the file COPYING. If not,
-- write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
-- Boston, MA 02111-1307, USA.
--
deferred class BENCH
--
-- Comparison : ARRAY2 Vs. FIXED_ARRAY2.
--
feature
-- According to the power of your computer, set `tuning'
-- to a good positive value. Default is for very small
-- computer :
tuning: INTEGER is 2000; -- 300;
feature {NONE}
cltn: COLLECTION2[DOUBLE] is
deferred
end;
count1: INTEGER is
do
Result := 1 + tuning;
end;
count2: INTEGER is
do
Result := 7 + tuning;
end;
frozen bench is
require
cltn.count = count1 * count2
do
increment(cltn,+2.5);
increment(cltn,-2.5);
increment(cltn,+2.5);
increment(cltn,-2.5);
check_all(cltn,0.0);
end;
increment(c: like cltn; value: DOUBLE) is
local
i1, i2: INTEGER;
do
from
i1 := c.upper1;
until
i1 < c.lower1
loop
from
i2 := c.upper2;
until
i2 < c.lower2
loop
c.put(c.item(i1,i2) + value,i1,i2);
i2 := i2 - 1;
end;
i1 := i1 - 1;
end;
end;
check_all(c: like cltn; value: DOUBLE) is
local
i1, i2: INTEGER;
do
from
i1 := c.upper1;
until
i1 < c.lower1
loop
from
i2 := c.upper2;
until
i2 < c.lower2
loop
if c.item(i1,i2) /= value then
std_output.put_string("Error bench.%N");
end;
i2 := i2 - 1;
end;
i1 := i1 - 1;
end;
end;
end -- BENCH
|
