File: plot.h

package info (click to toggle)
quickplot 1.0.1~rc-3
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 2,520 kB
  • sloc: ansic: 16,758; sh: 11,416; makefile: 337
file content (275 lines) | stat: -rw-r--r-- 7,030 bytes parent folder | download | duplicates (4)
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
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
/*
  Quickplot - an interactive 2D plotter

  Copyright (C) 1998-2011  Lance Arsenault


  This file is part of Quickplot.

  Quickplot is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published
  by the Free Software Foundation, either version 3 of the License,
  or (at your option) any later version.

  Quickplot is distributed in the hope that it will be useful, but
  WITHOUT ANY WARRANTY; without even the implied warranty of
  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  General Public License for more details.

  You should have received a copy of the GNU General Public License
  along with Quickplot.  If not, see <http://www.gnu.org/licenses/>.

*/


extern
void qp_plot_set_cairo_draw_mode(struct qp_plot *p, struct qp_graph *gr);

extern
void qp_plot_set_x11_draw_mode(struct qp_plot *p, struct qp_graph *gr);





static inline
int qp_plot_series_double_is_reading(struct qp_channel *c)
{
  /* This qp_channel_series_is_reading() is inline too */
  return qp_channel_series_is_reading(c);
}

static inline
int qp_plot_is_reading(struct qp_plot *p)
{
  return (p->x_is_reading(p->x) && p->y_is_reading(p->y));
}


/* qp_plot_begin() or qp_plot_end() must be called before this */
/* This is getting the inverse of the plots values.  It gets the
 * plot value that would be for a particular graph pixel x position. */
static inline
double qp_plot_get_xval(struct qp_plot *p, int x)
{
  return (x - p->xshift)/p->xscale;
}

/* qp_plot_begin_y() or qp_plot_end_y() must be called before this */
/* This is getting the inverse of the plots values.  It gets the
 * plot value that would be for a particular graph pixel y position. */
static inline
double qp_plot_get_yval(struct qp_plot *p, int y)
{
  return (y - p->yshift)/p->yscale;
}

/* qp_plot_begin_y() or qp_plot_end_y() must be called before this */
static inline
int qp_plot_get_xpixel(struct qp_plot *p, double x)
{
  return INT(p->xscale*x + p->xshift);
}

/* qp_plot_begin_y() or qp_plot_end_y() must be called before this */
static inline
int qp_plot_get_ypixel(struct qp_plot *p, double y)
{
  return INT(p->yscale*y + p->yshift);
}

static inline
void qp_plot_get_sig_fig(struct qp_plot *p, int width, int height)
{
  double a, b, k;

  if(p->sig_fig_x && p->sig_fig_y) return;

  a = qp_plot_get_xval(p, 0);
  b = qp_plot_get_xval(p, 1);
  ASSERT(b > a);
  k = 1.0/(b - a);

  b = ABSVAL(qp_plot_get_xval(p, width));
  a = ABSVAL(a);
  if(b < a)
    b = a;
  a = log10(b*k);
  p->sig_fig_x = INT(a);
  if(p->sig_fig_x < 1)
    p->sig_fig_x = 1;



  a = qp_plot_get_yval(p, 1);
  b = qp_plot_get_yval(p, 0);
  ASSERT(b > a);
  k = 1.0/(b - a);

  a = ABSVAL(qp_plot_get_yval(p, height));
  b = ABSVAL(b);
  if(b < a)
    b = a;
  a = log10(b*k);
  p->sig_fig_y = INT(a);
  if(p->sig_fig_y < 1)
    p->sig_fig_y = 1;
}

static inline
void qp_plot_scale(struct qp_plot *p,
      double xscale, double xshift, double yscale, double yshift)
{
  p->xscale = xscale*p->xscale0;
  p->xshift = INT(xscale*p->xshift0 + xshift);
  p->yscale = yscale*p->yscale0;
  p->yshift = INT(yscale*p->yshift0 + yshift);

  p->sig_fig_x = 0;
  p->sig_fig_y = 0;
}

static inline
void qp_plot_x_rescale(struct qp_plot *p, double xmin, double xmax)
{
  p->xscale0 = 1.0/(xmax - xmin);
  p->xshift0 = - xmin/(xmax - xmin);

  p->xscale = 0;
  p->sig_fig_x = 0;
}

static inline
void qp_plot_y_rescale(struct qp_plot *p, double ymin, double ymax)
{
  p->yscale0 = 1.0/(ymax - ymin);
  p->yshift0 = - ymin/(ymax - ymin);

  p->yscale = 0;
  p->sig_fig_y = 0;
}


/*****************************************************************/
/* All the functions below return a graph pixel x or y position. */
/*****************************************************************/


static inline
int qp_plot_begin(struct qp_plot *p,
      double xscale, double xshift, double yscale, double yshift,
      int xpix_min, int ypix_min, int xpix_max, int ypix_max,      
      double *x, double *y)
{
  qp_plot_scale(p, xscale, xshift, yscale, yshift);

  p->num_read = (size_t) -1;


  if(p->x->form == QP_CHANNEL_FORM_SERIES &&
      p->y->form == QP_CHANNEL_FORM_SERIES &&
      p->x->series.is_increasing &&
      qp_channel_series_length(p->x) == qp_channel_series_length(p->y) &&
      !p->x->series.has_nan && !p->y->series.has_nan)
  {
    /* culling */
    /* this is likely the most common case
     ****************************************
     *  A UNIFORMLY INCREASING X CHANNEL
     ****************************************/

    double xmin, xmax;
    size_t i, j, len;
    /* get the corresponding limiting plot channel values */
    /* Any values outside [xmin,xmax] would be culled */
    xmin = qp_plot_get_xval(p, xpix_min);
    xmax = qp_plot_get_xval(p, xpix_max);

    if(p->x->series.min > xmax || p->x->series.max < xmin)
      /* case: no data in bounds */
      goto nodata;

    if((p->x->series.min >= xmin && p->x->series.max <= xmax) ||
        p->x->series.min == p->x->series.max)
      /* all the channel data is in bounds */
      goto begining;

    len = qp_channel_series_length(p->x);
    j   = qp_channel_series_length(p->y);
    if(j < len)
      len = j;
    j = qp_channel_series_double_find_gt(p->x, &xmax);
    i = qp_channel_series_double_find_lt(p->x, &xmin);

    if(j < len -1)
      /* the number left to read after this returns */
      p->num_read = j - i;

    //DEBUG("plot %s  with indexes %zu to %zu \n", p->name, i, j);

    *x = p->xscale*xmin + p->xshift;
    *y = p->yscale*p->channel_series_y_index(p->y, i) + p->yshift;
    return (p->x_is_reading(p->x) && p->y_is_reading(p->y));
  }

begining:

  *x = p->xscale*p->channel_x_begin(p->x) + p->xshift;
  *y = p->yscale*p->channel_y_begin(p->y) + p->yshift;

  return (p->x_is_reading(p->x) && p->y_is_reading(p->y));


nodata:

  p->channel_x_end(p->x);
  p->channel_x_next(p->x);
  *x = END_DOUBLE;
  *y = END_DOUBLE;
  return 0; /* done reading, no values in bounds */
}


static inline
int qp_plot_end(struct qp_plot *p,
    double xscale, double xshift, double yscale, double yshift,
    double *x, double *y)
{
  p->num_read = (size_t) -1;

  qp_plot_scale(p, xscale, xshift, yscale, yshift);

  *x = p->xscale*p->channel_x_end(p->x) + p->xshift;
  *y = p->yscale*p->channel_y_end(p->y) + p->yshift;

  return (p->x_is_reading(p->x) && p->y_is_reading(p->y));

}

static inline
int qp_plot_next(struct qp_plot *p, double *x, double *y)
{
  *x = p->xscale*p->channel_x_next(p->x) + p->xshift;
  *y = p->yscale*p->channel_y_next(p->y) + p->yshift;

  if(p->num_read != (size_t) -1)
    return ((p->num_read)--);

  return (p->x_is_reading(p->x) && p->y_is_reading(p->y));
}

static inline
double qp_plot_prev(struct qp_plot *p, double *x, double *y)
{
  *x = p->xscale*p->channel_x_prev(p->x) + p->xshift;
  *y = p->yscale*p->channel_y_prev(p->y) + p->yshift;

  if(p->num_read)
  {
    --p->num_read;
    return p->num_read;
  }

  return (p->x_is_reading(p->x) && p->y_is_reading(p->y));
}