#include <Stats.h>
Definition at line 15 of file bilerp-study.cpp.
◆ Stats()
Definition at line 24 of file Stats.h.
24 {
25 int n = samples.
size();
26 if (!n) {
28 return;
29 }
30
33 for (int i = 0; i < n; i++) {
34 if (samples[i] <
min) {
min = samples[i]; }
35 if (samples[i] >
max) {
max = samples[i]; }
36 }
37
38 double sum = 0.0;
39 for (int i = 0 ; i < n; i++) {
40 sum += samples[i];
41 }
43
44 double err = 0.0;
45 for (int i = 0 ; i < n; i++) {
46 err += (samples[i] -
mean) * (samples[i] -
mean);
47 }
49
50 std::vector<double> sorted(samples.
begin(), samples.
end());
51 std::sort(sorted.begin(), sorted.end());
53
54
55 for (int i = 0; want_plot && i < n; i++) {
57
59 continue;
60 }
61
62 double s = samples[i];
65 s *= (std::size(
kBars) - 1);
66 const size_t bar = (size_t)(
s + 0.5);
69 }
70 }
#define SkASSERT_RELEASE(cond)
static constexpr double sk_ieee_double_divide(double numer, double denom)
static const char * kBars[]
void append(const char text[])
◆ log() [1/2]
void Stats::log |
( |
int16_t |
golden, |
|
|
int16_t |
candidate |
|
) |
| |
|
inline |
Definition at line 21 of file bilerp-study.cpp.
21 {
22 int64_t diff = candidate - golden;
27 }
◆ log() [2/2]
void Stats::log |
( |
int16_t |
golden, |
|
|
int16_t |
candidate |
|
) |
| |
|
inline |
Definition at line 21 of file lerp-study.cpp.
21 {
22 int diff = candidate - golden;
27 }
◆ print() [1/2]
void Stats::print |
( |
| ) |
const |
|
inline |
Definition at line 29 of file bilerp-study.cpp.
29 {
33 }
std::string printf(const char *fmt,...) SK_PRINTF_LIKE(1
◆ print() [2/2]
void Stats::print |
( |
| ) |
const |
|
inline |
◆ diff_8_bits [1/2]
int64_t Stats::diff_8_bits = 0 |
◆ diff_8_bits [2/2]
int Stats::diff_8_bits = 0 |
◆ max
◆ max_diff [1/2]
int64_t Stats::max_diff = 0 |
◆ max_diff [2/2]
◆ mean
◆ median
◆ min
◆ min_diff [1/2]
int64_t Stats::min_diff = 0 |
◆ min_diff [2/2]
◆ plot
◆ total
◆ var
The documentation for this struct was generated from the following files: