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
|
/* $Id: hist.c,v 1.10 2015/07/06 08:05:44 kristaps Exp $ */
/*
* Copyright (c) 2014, 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 <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "kplot.h"
#include "extern.h"
struct kdata *
kdata_hist_alloc(double rmin, double rmax, size_t bins)
{
struct kdata *d;
size_t i;
assert(rmax > rmin);
if (NULL == (d = calloc(1, sizeof(struct kdata))))
return(NULL);
d->refs = 1;
d->pairsz = bins;
d->pairs = calloc(d->pairsz, sizeof(struct kpair));
if (NULL == d->pairs) {
free(d);
return(NULL);
}
for (i = 0; i < bins; i++)
d->pairs[i].x = rmin +
i / (double)bins * (rmax - rmin);
d->type = KDATA_HIST;
d->d.hist.rmin = rmin;
d->d.hist.rmax = rmax;
return(d);
}
static ssize_t
kdata_hist_checkrange(const struct kdata *d, double v)
{
double frac;
ssize_t bucket;
if (KDATA_HIST != d->type)
return(-1);
else if (v < d->d.hist.rmin)
return(-1);
else if (v >= d->d.hist.rmax)
return(-1);
frac = (v - d->d.hist.rmin) /
(d->d.hist.rmax - d->d.hist.rmin);
assert(frac >= 0.0 && frac < 1.0);
bucket = floor((double)d->pairsz * frac);
if ((size_t)bucket == d->pairsz - 1) {
assert(d->pairs[bucket].x <= v);
} else {
assert(d->pairs[bucket].x <= v);
assert(d->pairs[bucket + 1].x >= v);
}
return(bucket);
}
int
kdata_hist_add(struct kdata *d, double v, double val)
{
ssize_t bucket;
double x, y;
if ((bucket = kdata_hist_checkrange(d, v)) < 0)
return(0);
x = d->pairs[bucket].x;
y = d->pairs[bucket].y + val;
return(kdata_set(d, bucket, x, y));
}
int
kdata_hist_set(struct kdata *d, double v, double y)
{
ssize_t bucket;
double x;
if ((bucket = kdata_hist_checkrange(d, v)) < 0)
return(0);
x = d->pairs[bucket].x;
return(kdata_set(d, bucket, x, y));
}
|
