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
|
/*
* Copyright © 2006 Red Hat, Inc.
*
* Permission to use, copy, modify, distribute, and sell this software
* and its documentation for any purpose is hereby granted without
* fee, provided that the above copyright notice appear in all copies
* and that both that copyright notice and this permission notice
* appear in supporting documentation, and that the name of
* the authors not be used in advertising or publicity pertaining to
* distribution of the software without specific, written prior
* permission. The authors make no representations about the
* suitability of this software for any purpose. It is provided "as
* is" without express or implied warranty.
*
* THE AUTHORS DISCLAIM ALL WARRANTIES WITH REGARD TO THIS
* SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND
* FITNESS, IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY SPECIAL,
* INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER
* RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION
* OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR
* IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*
* Authors: Carl Worth <cworth@cworth.org>
*/
#include "cairo-stats.h"
#include <assert.h>
void
_cairo_stats_compute (cairo_stats_t *stats,
cairo_time_t *values,
int num_values)
{
cairo_time_t sum, mean, q1, q3, iqr;
cairo_time_t outlier_min, outlier_max;
int i, min_valid, num_valid;
double s;
assert (num_values > 0);
if (num_values == 1) {
stats->min_ticks = stats->median_ticks = values[0];
stats->std_dev = 0;
stats->iterations = 1;
return;
}
/* First, identify any outliers, using the definition of "mild
* outliers" from:
*
* http://en.wikipedia.org/wiki/Outliers
*
* Which is that outliers are any values less than Q1 - 1.5 * IQR
* or greater than Q3 + 1.5 * IQR where Q1 and Q3 are the first
* and third quartiles and IQR is the inter-quartile range (Q3 -
* Q1).
*/
num_valid = num_values;
do {
num_values = num_valid;
qsort (values, num_values, sizeof (cairo_time_t), _cairo_time_cmp);
q1 = values[1*num_values/4];
q3 = values[3*num_values/4];
/* XXX assumes we have native uint64_t */
iqr = q3 - q1;
outlier_min = q1 - 3 * iqr / 2;
outlier_max = q3 + 3 * iqr / 2;
for (i = 0; i < num_values && values[i] < outlier_min; i++)
;
min_valid = i;
for (i = 0; i < num_values && values[i] <= outlier_max; i++)
;
num_valid = i - min_valid;
assert(num_valid);
values += min_valid;
} while (num_valid != num_values);
stats->iterations = num_valid;
stats->min_ticks = values[0];
stats->median_ticks = values[num_valid / 2];
sum = 0;
for (i = 0; i < num_valid; i++)
sum = _cairo_time_add (sum, values[i]);
mean = sum / num_valid;
/* Let's use a normalized std. deviation for easier comparison. */
s = 0;
for (i = 0; i < num_valid; i++) {
double delta = (values[i] - mean) / (double)mean;
s += delta * delta;
}
stats->std_dev = sqrt(s / num_valid);
}
|
