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
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
|
/*
[The "BSD license"]
Copyright (c) 2005-2009 Terence Parr
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. The name of the author may not be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
package org.antlr.runtime.misc;
import java.io.*;
import java.util.List;
/** Stats routines needed by profiler etc...
// note that these routines return 0.0 if no values exist in the X[]
// which is not "correct", but it is useful so I don't generate NaN
// in my output
*/
public class Stats {
public static final String ANTLRWORKS_DIR = "antlrworks";
/** Compute the sample (unbiased estimator) standard deviation following:
*
* Computing Deviations: Standard Accuracy
* Tony F. Chan and John Gregg Lewis
* Stanford University
* Communications of ACM September 1979 of Volume 22 the ACM Number 9
*
* The "two-pass" method from the paper; supposed to have better
* numerical properties than the textbook summation/sqrt. To me
* this looks like the textbook method, but I ain't no numerical
* methods guy.
*/
public static double stddev(int[] X) {
int m = X.length;
if ( m<=1 ) {
return 0;
}
double xbar = avg(X);
double s2 = 0.0;
for (int i=0; i<m; i++){
s2 += (X[i] - xbar)*(X[i] - xbar);
}
s2 = s2/(m-1);
return Math.sqrt(s2);
}
/** Compute the sample mean */
public static double avg(int[] X) {
double xbar = 0.0;
int m = X.length;
if ( m==0 ) {
return 0;
}
for (int i=0; i<m; i++){
xbar += X[i];
}
if ( xbar>=0.0 ) {
return xbar / m;
}
return 0.0;
}
public static int min(int[] X) {
int min = Integer.MAX_VALUE;
int m = X.length;
if ( m==0 ) {
return 0;
}
for (int i=0; i<m; i++){
if ( X[i] < min ) {
min = X[i];
}
}
return min;
}
public static int max(int[] X) {
int max = Integer.MIN_VALUE;
int m = X.length;
if ( m==0 ) {
return 0;
}
for (int i=0; i<m; i++){
if ( X[i] > max ) {
max = X[i];
}
}
return max;
}
/** Compute the sample mean */
public static double avg(List<Integer> X) {
double xbar = 0.0;
int m = X.size();
if ( m==0 ) {
return 0;
}
for (int i=0; i<m; i++){
xbar += X.get(i);
}
if ( xbar>=0.0 ) {
return xbar / m;
}
return 0.0;
}
public static int min(List<Integer> X) {
int min = Integer.MAX_VALUE;
int m = X.size();
if ( m==0 ) {
return 0;
}
for (int i=0; i<m; i++){
if ( X.get(i) < min ) {
min = X.get(i);
}
}
return min;
}
public static int max(List<Integer> X) {
int max = Integer.MIN_VALUE;
int m = X.size();
if ( m==0 ) {
return 0;
}
for (int i=0; i<m; i++){
if ( X.get(i) > max ) {
max = X.get(i);
}
}
return max;
}
public static int sum(int[] X) {
int s = 0;
int m = X.length;
if ( m==0 ) {
return 0;
}
for (int i=0; i<m; i++){
s += X[i];
}
return s;
}
public static void writeReport(String filename, String data) throws IOException {
String absoluteFilename = getAbsoluteFileName(filename);
File f = new File(absoluteFilename);
File parent = f.getParentFile();
parent.mkdirs(); // ensure parent dir exists
// write file
FileOutputStream fos = new FileOutputStream(f, true); // append
BufferedOutputStream bos = new BufferedOutputStream(fos);
PrintStream ps = new PrintStream(bos);
ps.println(data);
ps.close();
bos.close();
fos.close();
}
public static String getAbsoluteFileName(String filename) {
return System.getProperty("user.home")+File.separator+
ANTLRWORKS_DIR +File.separator+
filename;
}
}
|
