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
|
/* $Id: mean.c,v 1.5 2015/07/06 08:05:44 kristaps Exp $ */
/*
* Copyright (c) 2015 Kristaps Dzonsons <kristaps@bsd.lv>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, 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.
*/
#include "compat.h"
#include <assert.h>
#include <cairo.h>
#include <math.h>
#include <stdlib.h>
#include <string.h>
#include "kplot.h"
#include "extern.h"
static int
kdata_mean_set(struct kdata *d, size_t pos, double x, double y)
{
double delta, delta_n, newy;
void *p;
assert(KDATA_MEAN == d->type);
if (pos >= d->pairsz) {
/*
* A note on this.
* Our only growable data source is the vector, which
* can only grow one at a time.
* Thus, if we attach to a vector, we'll never exceed
* this.
* If we have non-monotonically increasing data source
* sizes, this will need to be addressed.
* FIXME: this is very inefficient!
*/
assert(pos == d->pairsz);
d->pairsz = pos + 1;
p = reallocarray(d->pairs,
d->pairsz, sizeof(struct kpair));
if (NULL == p)
return(0);
d->pairs = p;
p = reallocarray(d->d.mean.ns,
d->pairsz, sizeof(size_t));
if (NULL == p)
return(0);
d->d.mean.ns = p;
}
d->d.mean.ns[pos]++;
delta = y - d->pairs[pos].y;
delta_n = delta / (double)d->d.mean.ns[pos];
newy = d->pairs[pos].y + delta_n;
return(kdata_set(d, pos, x, newy));
}
struct kdata *
kdata_mean_alloc(struct kdata *dep)
{
struct kdata *d;
size_t i;
if (NULL == (d = calloc(1, sizeof(struct kdata))))
return(NULL);
d->refs = 1;
d->type = KDATA_MEAN;
if (NULL == dep)
return(d);
d->pairsz = dep->pairsz;
d->pairs = calloc(d->pairsz, sizeof(struct kpair));
d->d.mean.ns = calloc(d->pairsz, sizeof(size_t));
if (NULL == d->pairs || NULL == d->d.mean.ns) {
free(d->pairs);
free(d->d.mean.ns);
free(d);
return(NULL);
}
kdata_dep_add(d, dep, kdata_mean_set);
for (i = 0; i < dep->pairsz; i++)
d->pairs[i].x = dep->pairs[i].x;
return(d);
}
int
kdata_mean_attach(struct kdata *d, struct kdata *dep)
{
void *p;
size_t i;
if (KDATA_MEAN != d->type)
return(0);
if (NULL == dep)
return(1);
if (d->pairsz < dep->pairsz) {
p = reallocarray(d->pairs,
dep->pairsz, sizeof(struct kpair));
if (NULL == p)
return(0);
d->pairs = p;
/* FIXME: don't loop, just do the math. */
for (i = d->pairsz; i < dep->pairsz; i++)
memset(&d->pairs[i], 0, sizeof(struct kpair));
p = reallocarray(d->d.mean.ns,
dep->pairsz, sizeof(size_t));
if (NULL == p)
return(0);
d->d.mean.ns = p;
for (i = d->pairsz; i < dep->pairsz; i++)
d->d.mean.ns[i] = 0;
d->pairsz = dep->pairsz;
for (i = 0; i < dep->pairsz; i++)
d->pairs[i].x = dep->pairs[i].x;
}
kdata_dep_add(d, dep, kdata_mean_set);
return(1);
}
|
