blob: 9bd7460e0b1674423efb2aed7ac53defba777967 (
plain)
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
|
// SPDX-License-Identifier: GPL-3.0-or-later
#include "min.h"
// ----------------------------------------------------------------------------
// min
struct grouping_min {
calculated_number min;
size_t count;
};
void *grouping_create_min(RRDR *r) {
(void)r;
return callocz(1, sizeof(struct grouping_min));
}
// resets when switches dimensions
// so, clear everything to restart
void grouping_reset_min(RRDR *r) {
struct grouping_min *g = (struct grouping_min *)r->internal.grouping_data;
g->min = 0;
g->count = 0;
}
void grouping_free_min(RRDR *r) {
freez(r->internal.grouping_data);
r->internal.grouping_data = NULL;
}
void grouping_add_min(RRDR *r, calculated_number value) {
if(!isnan(value)) {
struct grouping_min *g = (struct grouping_min *)r->internal.grouping_data;
if(!g->count || calculated_number_fabs(value) < calculated_number_fabs(g->min)) {
g->min = value;
g->count++;
}
}
}
calculated_number grouping_flush_min(RRDR *r, RRDR_VALUE_FLAGS *rrdr_value_options_ptr) {
struct grouping_min *g = (struct grouping_min *)r->internal.grouping_data;
calculated_number value;
if(unlikely(!g->count)) {
value = 0.0;
*rrdr_value_options_ptr |= RRDR_VALUE_EMPTY;
}
else {
value = g->min;
}
g->min = 0.0;
g->count = 0;
return value;
}
|
